Seyed Masoud Hosseini · Overview · Study log · Ideas · Transcript · RSS feed

Design & Analysis of Algorithms

MIT 6.046 · Software · Fall 2028 · Planned

Lectures

  1. Lecture 1: Course Overview, Interval Scheduling (1:23:34)
  2. Lecture 2: Divide & Conquer: Convex Hull, Median Finding (1:20:34)
  3. Recitation 1: Matrix Multiplication and the Master Theorem (53:46)
  4. Lecture 3: Divide & Conquer: FFT (1:20:52)
  5. Recitation 2: 2-3 Trees and B-Trees (30:45)
  6. 4. Divide & Conquer: van Emde Boas Trees (1:20:14)
  7. 5. Amortization: Amortized Analysis (1:15:53)
  8. 6. Randomization: Matrix Multiply, Quicksort (1:21:52)
  9. R4. Randomized Select and Randomized Quicksort (39:29)
  10. 7. Randomization: Skip Lists (1:20:55)
  11. Lecture 8: Randomization: Universal & Perfect Hashing (1:21:51)
  12. Recitation 5: Dynamic Programming (52:02)
  13. Lecture 9: Augmentation: Range Trees (1:24:34)
  14. Lecture 10: Dynamic Programming: Advanced DP (1:20:07)
  15. 11. Dynamic Programming: All-Pairs Shortest Paths (1:21:49)
  16. 12. Greedy Algorithms: Minimum Spanning Tree (1:22:09)
  17. R6. Greedy Algorithms (22:24)
  18. 13. Incremental Improvement: Max Flow, Min Cut (1:22:57)
  19. 14. Incremental Improvement: Matching (1:22:32)
  20. Recitation 7: Network Flow, Edmonds-Karp, and Matching (51:12)
  21. Lecture 15: Linear Programming - LP, Reductions, Simplex (1:22:27)
  22. Lecture 16: Complexity - P, NP, NP-completeness, Reductions (1:25:25)
  23. Recitation 8: NP-Complete Problems (45:46)
  24. Lecture 17: Complexity - Approximation Algorithms (1:21:08)
  25. 18. Complexity: Fixed-Parameter Algorithms (1:17:43)
  26. R9. Approximation Algorithms: Traveling Salesman Problem (31:59)
  27. 19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees (1:17:33)
  28. 20. Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees (1:12:03)
  29. R10. Distributed Algorithms (50:18)
  30. 21. Cryptography: Hash Functions (1:22:00)
  31. 22. Cryptography: Encryption (1:24:14)
  32. R11. Cryptography: More Primitives (49:30)
  33. 23. Cache-Oblivious Algorithms: Medians & Matrices (1:20:27)
  34. Lecture 24: Cache-Oblivious Algorithms - Searching and Sorting (1:17:41)

Notes

No notes yet.

References

No references yet.

Study log

No log entries for this course yet.