|
LECTURE SCHEDULE
Wednesday, December 3:
Guest lecture by Dick Lipton about quantum computing
Monday, December 1:
RSA cryptosystem and primality testing
Monday, November 24:
Analyzing the convergence rate of Markov chains:
Generating a random matching
Monday, November 17 and Wednesday, November 19:
Introduction to Markov chains
PageRank
Eric's 11/19 notes
Eric's 11/17 notes
Some related lecture notes from a different class
Monday, November 10 and Wednesday, November 12:
Counting perfect matchings of planar graphs
Reading: See
Section 2 of Chapter 1 in Jerrum's book
Eric's 11/12 notes
Eric's 11/10 notes
Wednesday, November 5:
Maximum matchings in general graphs
Reading: Eric's 11/5 notes
Wednesday, October 29:
Maximum matchings in bipartite graphs
Reading: Eric's 10/29 notes
Monday, October 27:
Poly-time approximation algorithms for Metric TSP
Reading:
[DPV] Chapter 9.2.3
Eric's 10/27 notes
Monday, October 20 and
Wednesday, October 22:
FFT
Reading: [DPV] Chapter 2.6
Eric's 10/20 notes
Eric's 10/22 notes
Wednesday, October 15:
Minimax theorem for zero-sum games via LP duality
Eric's 10/15 notes
Wednesday, October 8:
Max-flow applications
Eric's 10/8 notes
Monday, October 6:
Max-flow algorithms: Ford-Fulkerson and Edmonds-Karp
algorithms
Reading: [DPV] Chapter 7.2 for Ford-Fulkerson and
see Eric's notes for Edmonds-Karp
Eric's 10/6 notes
Wednesday, October 1:
Randomized rounding and
3/4-approximation algorithm for Max-SAT
Eric's 10/1 notes
Monday, September 29:
Max-flow = Min-cut via linear programming duality
Reading: [DPV] Chapter 7.2 (though that's a different proof)
Eric's 9/29 notes
Wednesday, September 24:
Linear programming duality
Reading: [DPV] Chapters 7.4
Eric's 9/24 notes
Monday, September 22:
Linear programming and simplex algorithm
Reading: [DPV] Chapter 7.1
([DPV] refers to
Dasgupta-Papadimitriou-Vazirani's book Algorithms)
Eric's 9/22 notes
Monday, September 15 and Wednesday, September 17:
(guest lectures by Milena Mihail)
Chernoff bounds
Counting DNF solutions
Reading: [MU] Chapters 4.1-4.2 (for Chernoff) and 10.1-10.2 (for #DNF)
Wednesday, September 10:
Cuckoo hashing
Cuckoo Hashing for Undergraduates by Rasmus Pagh
Eric's 9/10 notes
Monday, September 8:
Bloom filters
Reading: [MU] Chapter 5.5
Eric's 9/8 notes
Wednesday, September 3:
Coupon Collector's Problem
Expected runtime of QuickSort
Reading: [MU] Chapters 2.4-2.5
Eric's 9/3 notes
Wednesday, August 27:
Approximation algorithms via method of conditional expectations
Reading: [MU] Chapter 6.3
Eric's 8/27 notes
Monday, August 25:
Max-cut: Existence of a large cut in every graph
Reading: [MU] Chapter 6.2
Eric's 8/25 notes
Monday, August 18 and
Wednesday, August 20:
Karger's min-cut algorithm
Reading: [MU] Chapter 1, especially 1.4
Lecture notes
Eric's 8/18 notes
Eric's 8/20 notes
|