Lect. | Date | Topics | Readings |
1 | 1/16/01 | Course Overview, Random Variables, Expected Values | MR 1.0 |
2 | 1/18/01 | Monte-Carlo, Las Vegas, Random Permutations | MR 1.2 |
3 | 1/23/01 | Randomized Quicksort and BSTs | MR 1,8.1 |
4 | 1/25/01 | More Permutations, inclusion/exclusion | MR 2.2 |
5 | 1/30/01 | Occupancy Problems | MR 3.1 |
6 | 2/1/01 | Markov and Chebyshev Inequalities, Random Selection | MR 3.2-3.3 |
7 | 2/6/01 | Stable Marriages and Coupon Collector's Problem | MR 3.5-3.6 |
8 | 2/8/01 | More on the Coupon Collector's Problem | MR 3.6 |
9 | 2/13/01 | Random Graphs | LN |
10 | 2/15/01 | Chernoff Bounds | MR 4.1 |
11 | 2/20/01 | Routing in a Parallel Computer | MR 4.2 |
12 | 2/22/01 | Program Checking/Polynomial Identities | MR 7.1-7.2 |
2/27/01 | Midterm 1, in class | ||
13 | 3/1/01 | Verifying Equality of Strings, Pattern Matching | MR 7.4-7.6 |
14 | 3/6/01 | Data-Punctuated Token Trees | LN |
15 | 3/8/01 | Randomized Data Structures | MR 8.3-8.4 |
16 | 3/13/01 | Graph Algorithms: Minimum Cuts | MR 10.2 |
17 | 3/15/01 | Graph Algorithms: Minimum Spanning Trees | MR 10.3 |
18 | 3/20/01 | Distributed Computing: Byzantine Agreement | MR 12.6 |
19 | 3/22/01 | Online Paging and Adversaries | MR 13.1-13.3 |
Spring Break, March 26-30 | |||
20 | 4/3/01 | Number theory | MR 14.1-2 |
21 | 4/5/01 | Public-key Encryption (Midterm 2 Evening) | MR 14.4 |
22 | 4/10/01 | Hash Algorithms, Digital Signatures, Key Exchange | W2, LN |
23 | 4/12/01 | Zero-Knowledge Proofs | W2, LN |
24 | 4/17/01 | Discrete Log ZKPs and Signatures | W2, LN |
25 | 4/19/01 | Secret Sharing and Threshold Decryption | LN |
26 | 4/24/01 | Electronic Voting 1 | LN |
27 | 4/26/01 | Electronic Voting 2 | LN |
28 | 5/1/01 | Digital Cash 1 | W3, LN |
29 | 5/3/01 | Digital Cash 2 | W3, LN |
30 | 5/8/01 | Wrap-up | |
5/16/01 | Final Exam, grp 14, 5-8pm, 285 Cory |