Spring 2009
[Main Page] [Assignments]
Topics |
Date |
Reference |
|
Divide and Conquer:
Integer Multiplication |
Monday, January 5
[KT] Chapter 5.5
| |
|
Divide and Conquer:
Deterministic Median finding algorithm |
Wednesday, January 7
Try:
| [Cormen-Leiserson-Rivest-Stein], lecture notes from UC Irvine, or see lecture 4 from CMU. |
|
Divide and Conquer:
Fast Fourier Transform |
Friday, January 9
and Monday, January 12
[KT] Chapter 5.6
| |
|
Dynamic Programming:
Knapsack ([KT] Chpt. 6.4) Edit Distance (6.6) Shortest Paths (6.8) |
Wednesday, January 14
to Wednesday, January 21
[KT] Chapter 6
| |
|
Network Flow and
Ford-Fulkerson Algorithm |
Friday, January 23
[KT] Chapter 7.1
| |
|
Max-Flow = Min-cut
Proof of correctness for the Ford-Fulkerson algorithm |
Monday, January 26
[KT] Chapter 7.2
| |
|
Scaling algorithm for Max-Flow
|
Wednesday, January 28
[KT] Chapter 7.3
| |
|
Exam 1
|
Friday, January 30
| |
|
Bipartite Matchings
|
Monday, February 2
[KT] Chapter 7.5
| |
|
Image segmentation
|
Wednesday, February 4
[KT] Chapter 7.10
| |
|
Project selection
|
Friday, February 6
[KT] Chapter 7.11
| |
|
Randomized algorithms:
Karger's Min-cut algorithm |
Monday, February 9
[KT] Chapter 13.2
| |
|
Randomized algorithms:
Approximating Max 3-SAT |
Wednesday, February 11
[KT] Chapter 13.3-5
| |
|
Hashing
|
Friday, February 13
[KT] Chapter 13.6
| |
|
Bloom Filters
|
Monday, February 16
See t-square for some related resources.
| |
|
Chernoff bounds and
Load balancing (This lecture is not on the exam.) |
Wednesday, February 18
[KT] Chapter 13.9-10
| |
|
Exam 2
|
Friday, February 20
| |