randomization

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▶2016 03 08 Max Flows IICS 473 Spring 2016Notes
   +Watch later
2. 2▶2016 03 03 Max Flows ICS 473 Spring 2016Notes
   +Watch later
3. 3▶2016 03 01 Locality Sensitive HashingCS 473 Spring 2016Notes
   +Watch later
4. 4▶2016 02 25 StreamingCS 473 Spring 2016Notes
   +Watch later
5. 5▶2016 02 23 Midterm I ReviewCS 473 Spring 2016Notes
   +Watch later
6. 6▶2016 02 18 Hashing IICS 473 Spring 2016Notes
   +Watch later
7. 7▶2016 02 16 Hashing ICS 473 Spring 2016Notes
   +Watch later
8. 8▶2016 02 11 Randomization IIICS 473 Spring 2016Notes
   +Watch later
9. 9▶2016 02 09 Randomization IICS 473 Spring 2016Notes
   +Watch later
10. 10▶2016 02 04 Randomization ICS 473 Spring 2016Notes
    +Watch later
11. 11▶2016 02 02 Advanced DP Tricks II Part 2CS 473 Spring 2016Notes
    +Watch later
12. 12▶2016 02 02 Advanced DP Tricks II Part 1CS 473 Spring 2016Notes
    +Watch later
13. 13▶2016 01 28 Advanced DP Tricks ICS 473 Spring 2016Notes
    +Watch later
14. 14▶2016 01 26 Dynamic Programming in a DAGCS 473 Spring 2016Notes
    +Watch later
15. 15▶2016 01 21 Dynamic Programming IICS 473 Spring 2016Notes
    +Watch later
16. 16▶5. Amortization: Amortized AnalysisMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
17. 17▶R5. Dynamic ProgrammingMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
18. 18▶11. Dynamic Programming: All-Pairs Shortest PathsMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
19. 19▶R1. Matrix Multiplication and the Master TheoremMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
20. 20▶8. Randomization: Universal & Perfect HashingMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
21. 21▶9. Augmentation: Range TreesMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
22. 22▶6. Randomization: Matrix Multiply, QuicksortMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
23. 23▶R4. Randomized Select and Randomized QuicksortMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
24. 24▶3. Divide & Conquer: FFTMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
25. 25▶1. Course Overview, Interval SchedulingMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
26. 26▶4. Divide & Conquer: van Emde Boas TreesMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
27. 27▶10. Dynamic Programming: Advanced DPMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
28. 28▶R2. 2-3 Trees and B-TreesMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
29. 29▶2. Divide & Conquer: Convex Hull, Median FindingMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later
30. 30▶7. Randomization: Skip ListsMIT 6.046J Design and Analysis of Algorithms, Spring 2015Notes
    +Watch later