| Lect. | Date | Topics | Readings |
| 1 | 1/19/99 | Course Overview, Random Variables, Expected Values | MR 1.0 |
| 2 | 1/21/99 | Monte-Carlo, Las Vegas, Random Permutations | MR 1.2 |
| 3 | 1/26/99 | Permutations, Binary Planar Partitions | MR 1.3 |
| 4 | 1/28/99 | More Permutations, inclusion/exclusion | MR 2.2 |
| 5 | 2/2/99 | Occupancy Problems | MR 3.1 |
| 6 | 2/4/99 | Markov and Chebyshev Inequalities, Random Selection | MR 3.2-3.3 |
| 7 | 2/9/99 | Stable Marriages and Coupon Collector's Problem | MR 3.5-3.6 |
| 8 | 2/11/99 | More on the Coupon Collector's Problem | MR 3.6 |
| 9 | 2/16/99 | Chernoff Bounds | MR 4.1 |
| 10 | 2/18/99 | **Inclusion/Exclusion (lecture in 141 McCone Hall) | LN |
| 11 | 2/23/99 | Routing in a Parallel Computer | MR 4.2 |
| 12 | 2/25/99 | Program Checking/Polynomial Identities | MR 7.1-7.2 |
| 3/2/99 | Midterm 1, in class | ||
| 13 | 3/4/99 | Verifying Equality of Strings, Pattern Matching | MR 7.4-7.6 |
| 14 | 3/9/99 | Fingerprint Trees | LN |
| 15 | 3/11/99 | Distributed Computing: Choice Coordination | MR 12.5 |
| 16 | 3/16/99 | Distributed Computing: Byzantine Agreement | MR 12.6 |
| 17 | 3/18/99 | Online Paging and Adversaries | MR 13.1-13.3 |
| Spring Break 3/22/99 – 3/26/99 | |||
| 18 | 3/30/99 | Graph Algorithms: Minimum Cuts | MR 10.2 |
| 19 | 4/1/99 | Graph Algorithms: Minimum Spanning Trees | MR 10.3 |
| 20 | 4/6/99 | Expander graphs/ Midterm 2 | LN, MR 5.3 |
| 21 | 4/8/99 | Number Theory, Euclid's Algorithm | MR 14.1 |
| 22 | 4/13/99 | Groups and Fields and the Chinese Remainder Theorem | MR 14.2 |
| 23 | 4/15/99 | Totient Function, Euler's and Fermat's Theorems | MR 14.2 |
| 24 | 4/20/99 | The RSA Public-key Encryption Scheme | MR 14.4 |
| 25 | 4/22/99 | Hash Algorithms, MD5, Digital Signatures | W2, LN |
| 26 | 4/27/99 | Zero-Knowledge Proofs | W2, LN |
| 27 | 4/29/99 | Kerberos, Secret sharing | W2, LN |
| 28 | 5/4/99 | Digital Cash 1 | W3, LN |
| 29 | 5/6/99 | Digital Cash 2 | W3, LN |
| 5/19/99 | Final Exam, group 14, 5-8pm May 19 in 60 Evans | ||