RSS Amplifier

Video feed

MIT 6.5220 Randomized Algorithms Fall 2025

youtube.comSource feed ↗15 videos

Live Last read · last published · next check

Written by

Latest videos

Saves to your Watch queue, to pick up on another day or another device.

6 5220 Lecture 4 Game theory, Lower Bounds 1, Coupon Collecting, Stable Matching.

Play

6 5220 Lecture 3 Adelman's theorem, Game tree evaluation

Play

6 5220 Lecture 2 Min-cut, Complexity theory.

Play

6 5220 Lecture 1 Introduction to Randomized Algorithms. Quicksort, BSP.

Play

6 5220 Lecture 16: Parallel Maximal Independent Set. Derandomization.

Play

6 5220 Lecture 18 Sampling: transitive closure. DNF counting, rare events.

Play

6 5220 Lecture 14: Symmetry breaking. Parallel Algorithms. Ethernet. Perfect matching.

Play

6 5220 Lecture 13: Fingerprinting by polynomials, perfect matching, network coding.

Play

6 5220 Lecture 12: Text search. Bloom filters.

Play

6 5220 Lecture 11: Consistent Hashing. Fingerprinting.

Play

6 5220 Lecture 10: 2 Choices (cont). Cuckoo Hashing.

Play

6 5220 Lecture 8: The power of two choices.

Play

6 5220 Lecture 7: Chernoff Bound. Randomized routing.

Play

6 5220 Lecture 6 Median finding. Pseudorandom numbers.

Play

6.5220 Lecture 5 Deviations: Markov, Chebyshev. Balls in Bins

Play