randomized algorithms

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶6 5220 Lecture 4 Game theory, Lower Bounds 1, Coupon Collecting, Stable Matching.MIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
2. 2▶6 5220 Lecture 3 Adelman's theorem, Game tree evaluationMIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
3. 3▶6 5220 Lecture 2 Min-cut, Complexity theory.MIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
4. 4▶6 5220 Lecture 1 Introduction to Randomized Algorithms. Quicksort, BSP.MIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
5. 5▶6 5220 Lecture 16: Parallel Maximal Independent Set. Derandomization.MIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
6. 6▶6 5220 Lecture 18 Sampling: transitive closure. DNF counting, rare events.MIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
7. 7▶6 5220 Lecture 14: Symmetry breaking. Parallel Algorithms. Ethernet. Perfect matching.MIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
8. 8▶6 5220 Lecture 13: Fingerprinting by polynomials, perfect matching, network coding.MIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
9. 9▶6 5220 Lecture 12: Text search. Bloom filters.MIT 6.5220 Randomized Algorithms Fall 2025Notes
   +Watch later
10. 10▶6 5220 Lecture 11: Consistent Hashing. Fingerprinting.MIT 6.5220 Randomized Algorithms Fall 2025Notes
    +Watch later
11. 11▶6 5220 Lecture 10: 2 Choices (cont). Cuckoo Hashing.MIT 6.5220 Randomized Algorithms Fall 2025Notes
    +Watch later
12. 12▶6 5220 Lecture 8: The power of two choices.MIT 6.5220 Randomized Algorithms Fall 2025Notes
    +Watch later
13. 13▶6 5220 Lecture 7: Chernoff Bound. Randomized routing.MIT 6.5220 Randomized Algorithms Fall 2025Notes
    +Watch later
14. 14▶6 5220 Lecture 6 Median finding. Pseudorandom numbers.MIT 6.5220 Randomized Algorithms Fall 2025Notes
    +Watch later
15. 15▶6.5220 Lecture 5 Deviations: Markov, Chebyshev. Balls in BinsMIT 6.5220 Randomized Algorithms Fall 2025Notes
    +Watch later
16. 16▶Lovász Local lemma (Randomized algorithms, Fall 2022, Lecture 15)Randomized Algorithms, Fall 2022Notes
    +Watch later
17. 17▶PAC learning (Randomized algorithms, Fall 2022, Lecture 13)Randomized Algorithms, Fall 2022Notes
    +Watch later
18. 18▶Entropy and codes (Randomized algorithms, Fall 2022, Lecture 14)Randomized Algorithms, Fall 2022Notes
    +Watch later
19. 19▶Geometric sampling (Randomized algorithms, Fall 2022, Lecture 12)Randomized Algorithms, Fall 2022Notes
    +Watch later
20. 20▶Randomized tree metrics (Randomized algorithms, Fall 2022, Lecture 11)Randomized Algorithms, Fall 2022Notes
    +Watch later
21. 21▶Sparsest cut (Randomized algorithms, Fall 2022, Lecture 10)Randomized Algorithms, Fall 2022Notes
    +Watch later
22. 22▶Locality-sensitive hashing (Randomized algorithms, Fall 2022, Lecture 9)Randomized Algorithms, Fall 2022Notes
    +Watch later
23. 23▶Dimensionality reduction (Randomized algorithms, Fall 2022, Lecture 8)Randomized Algorithms, Fall 2022Notes
    +Watch later
24. 24▶Distinct elements (Randomized algorithms, Fall 2022, Lecture 7)Randomized Algorithms, Fall 2022Notes
    +Watch later
25. 25▶Randomized rounding (Randomized algorithms, Fall 2022, Lecture 6)Randomized Algorithms, Fall 2022Notes
    +Watch later
26. 26▶Random sums and graphs (Randomized algorithms, Fall 2022, Lecture 5)Randomized Algorithms, Fall 2022Notes
    +Watch later
27. 27▶Randomized minimum cut (Randomized algorithms, Fall 2022, Lecture 4)Randomized Algorithms, Fall 2022Notes
    +Watch later
28. 28▶Hash tables and linear probing (Randomized algorithms, Fall 2022, Lecture 3)Randomized Algorithms, Fall 2022Notes
    +Watch later
29. 29▶Hashing and heavy hitters (Randomized algorithms, Fall 2022, Lecture 2)Randomized Algorithms, Fall 2022Notes
    +Watch later
30. 30▶Randomized searching and sorting (Randomized algorithms, Fall 2022, Lecture 1)Randomized Algorithms, Fall 2022Notes
    +Watch later
31. 31▶CSE290A, Spring 2020: Lec 16, the Count-Min sketch, and the AMS algorithm for frequency momentsCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
32. 32▶CSE290A, Spring 2020: Lec 15, improved distinct elements and introduction to heavy hittersCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
33. 33▶CSE290A, Spring 2020: Lec 14, counting distinct elements in the streaming modelCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
34. 34▶CSE290A, Spring 2020: Lec 12, Introduction to distribution testingCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
35. 35▶CSE290A, Spring 2020: Lec 11, the Poisson approximating and PoissonlzationCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
36. 36▶CSE290A, Spring 2020: Lec 9, proof of the Chernoff upper tail, discussion of the tail boundCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
37. 37▶CSE290A, Spring 2020: The Johnson-Lindenstrauss lemmaCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
38. 38▶CSE290A, Spring 2020: Estimating the average degree of a graphCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
39. 39▶CSE290A, Spring 2020: Lec 7, Walker's alias methodCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
40. 40▶CSE290A, Randomized Algorithms: Lec6, Cohen-Lewis matrix multiplicationCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
41. 41▶CSE290A, Spring 2020: Lec 5, improved Karp-Luby-MadrasCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
42. 42▶CSE290A Spring 2020: Lec 4, Karp-Luby importance samplingCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
43. 43▶CSE290A, Spring 2020: Lec 3, Chernoff boundsCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
44. 44▶CSE290A, Spring 2020: Lec 2, the Hoeffing boundCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later
45. 45▶CSE290A, Spring 2020, Lec1: Quicksort and Karger's mincutCSE290A, Spring 2020: Randomized AlgorithmsNotes
    +Watch later