CS 761
Course notes
Lecture 1 (May 9): Introduction [pdf, one]

Lecture 2 (May 11): Isolating Cuts [pdf, one]

Lecture 3 (May 16): Concentration Inequalities [pdf, one]

Lecture 4 (May 18): Approximation Algorithms [pdf, one]

Lecture 5 (May 25, 30): Dimension Reduction and Compressed Sensing [pdf, one]

Lecture 6 (June 1, 6): Graph Sketching [pdf, one]

Lecture 7 (June 6, 8): Local Lemma [pdf, one]

Lecture 8 (June 13): Martingales [pdf, one]

Lecture 9 (June 15): Discrepancy Minimization [pdf, one]

Lecture 10 (June 27): Spectral Sparsification [pdf, one]

Lecture 11 (June 29): Numerical Linear Algebra [pdf, one]

Lecture 12 (July 4): Random Walks [pdf, one]

Lecture 13 (July 6): Electrical Networks [pdf, one]

Lecture 14 (July 11, 13): Mixing Time [pdf, one]

Lecture 15 (July 18): Markov Chain Monte Carlo [pdf, one]

Lecture 16 (July 20): Coupling [pdf, one]

Lecture 17 (July 25): Polynomial Identity Testing [pdf, one]

Lecture 18 (July 27): Network Coding [pdf, one]

Lecture 19 (Optional): Interactive Proofs [pdf, one]
