
MIT 6.5220 Randomized Algorithms Fall 2025
Live Last read · last published · next check
Latest videos
Saves to your Watch queue, to pick up on another day or another device.


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.

6 5220 Lecture 7: Chernoff Bound. Randomized routing.

6 5220 Lecture 6 Median finding. Pseudorandom numbers.

