Design and Analysis of Algorithms

Lecture Notes

LEC #	LECTURE NOTES	LECTURE NOTES (HANDWRITTEN)
1	Overview, Interval Scheduling (PDF)	Overview, Interval Scheduling (PDF)
2	Divide & Conquer: Convex Hull, Median Finding (PDF)	Divide & Conquer: Convex Hull, Median Finding (PDF)
3	Divide & Conquer: FFT (PDF)	Divide & Conquer: FFT (PDF - 4.8MB)
4	Divide & Conquer: Van Emde Boas Trees (PDF)	Divide & Conquer: Van Emde Boas Trees (PDF - 4.3MB)
5	Amortization: Amortized Analysis (PDF)	Amortization: Amortized Analysis (PDF - 6.2MB)
6	Randomization: Matrix Multiply, Quicksort (PDF)	Randomization: Matrix Multiply, Quicksort (PDF)
7	Randomization: Skip Lists (PDF)	Randomization: Skip Lists (PDF)
8	Randomization: Universal & Perfect Hashing (PDF)	Randomization: Universal & Perfect Hashing (PDF - 5.2MB)
9	Augmentation: Range Trees (PDF)	Augmentation: Range Trees (PDF - 4.5MB)
10	Dynamic Programming: Advanced DP (PDF)	Dynamic Programming: Advanced DP (PDF)
11	Dynamic Programming: All-pairs Shortest Paths (PDF)	Dynamic Programming: All-pairs Shortest Paths 11 (PDF - 5.6MB)
12	Greedy Algorithms: Minimum Spanning Tree (PDF)	Greedy Algorithms: Minimum Spanning Tree (PDF - 5.1MB)
13	Incremental Improvement: Max Flow, Min Cut (PDF)	None
14	Incremental Improvement: Matching (PDF) Baseball Elimination Notes (PDF)	None
15	Linear Programming: LP, Reductions, Simplex (PDF)	Linear Programming: LP, Reductions, Simplex 15 (PDF)
16	Complexity: P, NP, NP-completeness, Reductions (PDF)	Complexity: P, NP, NP-completeness, Reductions 16 (PDF - 8.1MB)
17	Complexity: Approximation Algorithms (PDF)	Complexity: Approximation Algorithms (PDF)
18	Complexity: Fixed-parameter Algorithms (PDF)	Complexity: Fixed-parameter Algorithms (PDF - 6.4MB)
19	Synchronous Distributed Algorithms: Symmetry-breaking. Shortest-paths Spanning Trees (PDF)	None
20	Asynchronous Distributed Algorithms: Shortest-paths Spanning Trees (PDF)	None
21	Cryptography: Hash Functions (PDF)	Cryptography: Hash Functions (PDF)
22	Cryptography: Encryption (PDF)	Cryptography: Encryption (PDF)
23	Cache-oblivious Algorithms: Medians & Matrices (PDF)	Cache-oblivious Algorithms: Medians & Matrices 23 (PDF - 6.1MB)
24	Cache-oblivious Algorithms: Searching & Sorting (PDF)	Cache-oblivious Algorithms: Searching & Sorting (PDF - 5.4MB)