Design and Analysis of Algorithms
by Herbert Edelsbrunner
Publisher: Duke University 2008
Number of pages: 95
Description:
The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.
Download or read it online for free here:
Download link
(1MB, PDF)
Similar books
Lecture Notes on Bucket Algorithmsby Luc Devroye - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
(6523 views)
Average Case Analysis of Algorithms on Sequencesby Wojciech Szpankowski - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
(6980 views)
Problem Solving with Algorithms and Data Structures Using Pythonby Brad Miller, David Ranum - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(5301 views)
Algorithms: Fundamental Techniquesby Macneil Shonle, Matthew Wilson, Martin Krischik - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
(10786 views)