Lecture 25
2025 / 5 / 22
Graph Colorings Algorithmic LLL
Lecture 24
2025 / 5 / 19
Mixing Time Coupling
Lecture 23
2025 / 5 / 15
Markov Chains Stationary Distribution Metropolis Process
Lecture 22
2025 / 5 / 12
Packet Routing Asymmetric LLL Frugal Graph Coloring
Lecture 21
2025 / 5 / 8
Lovász Local Lemma
Lecture 20
2025 / 4 / 28
Percolation on d-Regular Graphs
Lecture 19
2025 / 4 / 24
Ballot Submartingale Random 2-SAT
Lecture 18
2025 / 4 / 21
Quick Sort Optional Stopping Theorem Gambler's Ruin
Lecture 17
2025 / 4 / 17
Martingale Azuma Inequality Doob Martingale
Lecture 16
2025 / 4 / 14
Johnson & Lindenstrauss Lemma Embedding into lp metrics
Lecture 15
2025 / 4 / 10
Giant Component (2)
Lecture 14
2025 / 4 / 7
Giant Component (1)
Lecture 13
2025 / 3 / 31
Power of 2 Choices (2) Galton-Watson Branching Process
Lecture 12
2025 / 3 / 27
Balls and Bins (2) Power of 2 Choices (1)
Lecture 11
2025 / 3 / 24
Hamilton Cycles (2) Balls and Bins (1)
Lecture 10
2025 / 3 / 20
Randomized Routing Hamilton Cycles (1)
Lecture 9
2025 / 3 / 17
Network Reliability (2) Chernoff Bounds
Lecture 8
2025 / 3 / 13
DNF Counting Network Reliability (1)
Lecture 7
2025 / 3 / 10
Double Hashing Buffon's Needle Median Trick
Lecture 6
2025 / 3 / 6
Pairwise Independence Probability Amplification Derandomization Universal Hashing
Lecture 5
2025 / 3 / 3
Monotone Circuits Majority Function
Lecture 4
2025 / 2 / 27
Unbalancing Lights Large Girth and Chromatic Number MAX3SAT 4-Cliques
Lecture 3
2025 / 2 / 24
Primality Probabilistic Method Independent Set Crossing Number
Lecture 2
2025 / 2 / 20
Bipartite Matching Perfect Matching in Parallel Fingerprinting
Lecture 1
2025 / 2 / 17
Matrix Multiplication Associativity Polynomial Identities