| Lec.
| Date
| Day
| Topic
| Notes
|
| 1 |
Sep 4 |
T |
Introduction, Karatsuba/Strassen |
|
| 2 |
Sep 6 |
Th |
Asymptotic analysis, recurrences
|
HW1 out
|
| 3 |
Sep 11 |
T |
Probabilistic analysis, randomized quicksort |
|
| 4 |
Sep 13 |
Th |
Linear time selection/median |
HW1 due, HW2 out
|
| 5 |
Sep 18 |
T |
Sorting: O(1) algorithms and Ω(n log n) lower bound |
|
| 6 |
Sep 20 |
Th |
Balanced Search Trees |
|
| 7 |
Sep 25 |
T |
Amortized Analysis |
HW2 due, HW3 out
|
| 8 |
Sep 27 |
Th |
Heaps |
|
| 9 |
Oct 2 |
T |
Union-Find |
|
| 10 |
Oct 4 |
Th |
Universal and Perfect Hashing |
HW3 due, HW4 out
|
| 11 |
Oct 9 |
T |
Dynamic Programming I |
|
| 12 |
Oct 11 |
Th |
Dynamic Programming II |
|
| 13 |
Oct 16 |
T |
BFS, DFS, topological sort, strongly-connected components |
HW4 due
|
| 14 |
Oct 18 |
Th |
Shortest Paths |
|
|
Oct 23 |
T |
Midterm
|
HW5 out
|
| 15 |
Oct 25 |
Th |
Minimum Spanning Trees |
|
| 16 |
Oct 30 |
T |
Matroids and Greedy Algorithms |
|
| 17 |
Nov 1 |
Th |
Max-Flow Min-Cut |
HW5 due, HW6 out
|
| 18 |
Nov 6 |
T |
Max-Flow:Edmonds-Karp |
|
| 19 |
Nov 8 |
Th |
Linear Programming |
|
| 20 |
Nov 13 |
T |
NP-Completeness I |
HW6 due, HW7 out
|
| 21 |
Nov 15 |
Th |
NP-Completeness II |
|
|
Nov 20 |
T |
No Class: Thanksgiving break |
|
|
Nov 22 |
Th |
No Class: Thanksgiving break |
|
| 22 |
Nov 27 |
T |
Approximation Algorithms |
HW7 due, HW8 out
|
| 23 |
Nov 29 |
Th |
Online Algorithms |
|
| 24 |
Dec 4 |
T |
Machine Learning Theory |
|
| 25 |
Dec 6 |
Th |
Algorithmic Game Theory |
HW8 due
|
|
Dec 21 |
9am-12pm |
Final Exam
|
|