| Jan 18 |
Lecture 1 |
Quicksort, secretary problem, online paging |
| Jan 18 |
Problem session 1 |
Ski rental, paging, secretary variants |
| Jan 25 |
Lecture 2 |
Skip lists, universal hashing |
| Jan 25 |
Problem session 2 |
Universal hashing, skip lists, Rabin–Karp |
| Feb 1 |
Lecture 3 |
Chernoff bounds, balls into bins |
| Feb 1 |
Problem session 3 |
Probabilistic method, coupon collector |
| Feb 8 |
Lecture 4 |
Synchronous message passing, BFS, coloring |
| Feb 8 |
Problem session 4 |
Synchronous model, BFS, Cole–Vishkin |
| Feb 22 |
Lecture 5 |
Symmetry breaking, Luby's MIS |
| Feb 22 |
Problem session 5 |
MIS and coloring, leader election in rings |
| Mar 1 |
Lecture 6 |
Asynchrony, faults, FLP impossibility |
| Mar 1 |
Problem session 6 |
Asynchronous BFS, bivalence arguments |
| Mar 8 |
Lecture 7 |
Approximate, randomized, Byzantine consensus |
| Mar 8 |
Problem session 7 |
Consensus rates and resilience bounds |
| Mar 15 |
Final exam |