Advanced Graduate Algorithms
CS 6550 - SPRING 2019
[ Home |
Lectures
| Homeworks
]
|
LECTURE SCHEDULE Tuesday, January 8: Karger's min-cut algorithm Thursday, January 10: Randomized linear-time median algorithm Tuesday, January 15: Chernoff bounds Thursday, January 17: Streaming: Frequency moments Tuesday, January 22: Pairwise independence and streaming (# of distinct elements) Thursday, January 24: More streaming: better approx. alg. for # of distinct elements Tuesday, January 29: Snow day Thursday, January 31: Derandomization via pairwise indp't.: Luby's Maximal Independent Set Tuesday, February 5: Derandomization via Method of Conditional Expectations and LP Randomized Rounding: Max-SAT approx. alg. Thursday, February 7: Semidefinite Programming: Max-Cut approx. alg. Tuesday, February 12: Polynomial identity testing and isolation lemma/perfect matchings Thursday, February 14: Parallel perfect matchings and Fingerprinting Tuesday, February 19: Primality testing and RSA cryptosystem For the proof of the Miller-Rabin test, see Greg Valiant's lecture notes Thursday, February 21: Random projection: Johnson-Lindenstrauss Tuesday, February 26: Guest lecture by Vivek Madan Thursday, February 28: Lovasz Local Lemma (LLL) Tuesday, March 5: Algorithmic LLL Thursday, March 7: Power of two choices Tuesday, March 12: Hashing: Bloom filters and Cuckoo hashing Thursday, March 14: Midterm exam Tuesday, March 26: Monte Carlo: #DNF and Network Unreliability Thursday, March 28: Monte Carlo: #Knapsack Tuesday, April 2: Markov Chains: 2-SAT, MC basics, and PageRank Thursday, April 4: Coupling Technique Tuesday, April 9: Coupling from the Past Thursday, April 11: Counting via Sampling, Canonical Paths Tuesday, April 16: Random Matchings Thursday, April 18: Volume estimation |