CS 566 – Efficient Algorithms (Winter 2026-27): videos
All lecture videos · module page · YouTube playlist
22 videos, 7 h 34 min
| Video | Date | Title | Length | Transcript |
|---|---|---|---|---|
| 0 | 2026-10-12 | Administrativa | 49:15 | transcript & video |
| 1-1 | 2026-10-12 | Random Shuffle | 13:21 | transcript & video |
| 1-2 | 2026-10-12 | Proof Templates | 15:33 | transcript & video |
| 1-3 | 2026-10-13 | Mathematical Induction | 16:32 | transcript & video |
| 1-4 | 2026-10-13 | Correctness Proofs | 31:45 | transcript & video |
| 2-1 | 2026-10-13 | Algorithm Analysis | 10:12 | transcript & video |
| 2-2 | 2026-10-13 | The Word-RAM Model | 18:24 | transcript & video |
| 2-3 | 2026-10-19 | Asymptotics and Big-Oh | 37:10 | transcript & video |
| 2-4 | 2026-10-19 | Asymptotic Pitfalls | 13:50 | transcript & video |
| 2-5 | 2026-10-19 | Hindsight Capital | 10:02 | transcript & video |
| 2-6 | 2026-10-19 | Algorithm Design Teaser - The Maximum Subarray Problem | 19:50 | transcript & video |
| 2-8 | 2026-10-20 | Algorithm Design Teaser | 27:53 | transcript & video |
| 3-1 | 2026-10-20 | Stacks and Queues | 28:00 | transcript & video |
| 3-2 | 2026-10-20 | Resizing Arrays | 17:17 | transcript & video |
| 3-3 | 2026-10-26 | Resizable arrays deamortized & optimal space | 11:39 | transcript & video |
| 3-4 | 2026-10-26 | Operations on Binary Heaps | 24:28 | transcript & video |
| 3-4 | 2026-10-26 | Priority Queues and Binary Heaps | 14:38 | transcript & video |
| 3-5 | 2026-10-26 | Symbol Tables and Binary Search Trees | 22:35 | transcript & video |
| 3-6 | 2026-10-27 | Analysis of Random BSTs | 30:27 | transcript & video |
| 3-7 | 2026-10-27 | Augmented BSTs | 17:16 | transcript & video |
| 3-8 | 2026-10-27 | Balanced BSTs | 6:20 | transcript & video |
| 3-9 | 2026-10-27 | Uniform Chaining Hashing Analysis | 18:04 | transcript & video |