| Lecture 1 (External Memory Algorithms and Data Structures: B-tree)
| ||
| Lecture 2 (External Memory Algorithms and Data Structures: Sorting)
| ||
| Lecture 3 (Text Searching Algorithms)
| ||
| Lecture 4 (Text Searching Data Structures)
| ||
| Lecture 5 (Greedy Algorithms)
| ||
| Lecture 6 (Dynamic Programming)
| ||
| Lecture 7 (Advanced Graph Algorithms: All-Pairs Shortest Paths)
| ||
| Lecture 8 (Advanced Graph Algorithms: Maximum Flow)
| ||
| Lecture 9 (Computational Geometry Algorithms)
| ||
| Lecture 10 (Computational Geometry Algorithms)
| ||
| Lecture 11 (Computational Geometry Data Structures: Range Searching)
| ||
| Lecture 12 (Amortized Analysis)
| ||
| Lecture 13 (Coping with NP-completeness: Approximation Algorithms)
| ||
| Lecture 14 (Coping with NP-completeness: Backtracking and Branch-and-Bound)
| ||
Advanced Algorithm Analysis and Design
( Click to Download Power Point Lectures)
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment