David Karger's Lectures
Publishes 1 feed
MIT 6.5220 Randomized Algorithms Fall 2025
15 posts · theirs
Lately
6 5220 Lecture 4 Game theory, Lower Bounds 1, Coupon Collecting, Stable Matching.
6 5220 Lecture 3 Adelman's theorem, Game tree evaluation
6 5220 Lecture 2 Min-cut, Complexity theory.
6 5220 Lecture 1 Introduction to Randomized Algorithms. Quicksort, BSP.
6 5220 Lecture 16: Parallel Maximal Independent Set. Derandomization.
6 5220 Lecture 18 Sampling: transitive closure. DNF counting, rare events.
6 5220 Lecture 14: Symmetry breaking. Parallel Algorithms. Ethernet. Perfect matching.
6 5220 Lecture 13: Fingerprinting by polynomials, perfect matching, network coding.
6 5220 Lecture 12: Text search. Bloom filters.
6 5220 Lecture 11: Consistent Hashing. Fingerprinting.
6 5220 Lecture 10: 2 Choices (cont). Cuckoo Hashing.
6 5220 Lecture 8: The power of two choices.
Everything on this page was read from markup David Karger's Lectures published — a rel="me" link, an h-card, or the feed’s own author element. Nothing was inferred from anywhere else. To correct or remove it, get in touch. Machine-readable: JSON