CS 650 – Advanced Data Structures (Summer 2026): videos
All lecture videos · module page · YouTube playlist
71 videos, 29 h 44 min
| Video | Date | Title | Length | Transcript |
|---|---|---|---|---|
| 0 | 2026-04-13 | Administrativa & motivation | 26:18 | transcript & video |
| 1-1 | 2026-04-13 | Recap - Sorted Dictionary and BSTs | 18:57 | transcript & video |
| 1-2 | 2026-04-13 | What’s wrong with BBSTs? | 7:20 | transcript & video |
| 1-3 | 2026-04-13 | Random BST model | 24:50 | transcript & video |
| 1-4 | 2026-04-14 | Properties of Random BSTs | 1:14:41 | transcript & video |
| 1-5 | 2026-04-20 | Treaps | 17:33 | transcript & video |
| 1-6 | 2026-04-20 | Updates in Treaps | 44:12 | transcript & video |
| 1-7 | 2026-04-20 | Insert at root | 12:09 | transcript & video |
| 1-8 | 2026-04-21 | Randomized BSTs | 18:20 | transcript & video |
| 1-9 | 2026-04-21 | Skip lists | 38:36 | transcript & video |
| 1-10 | 2026-04-21 | Skip list updates | 7:29 | transcript & video |
| 1-11 | 2026-04-27 | Jumplists | 13:58 | transcript & video |
| 1-12 | 2026-04-27 | Jumplists search analysis | 10:19 | transcript & video |
| 1-13 | 2026-04-27 | Jumplists updates | 16:57 | transcript & video |
| 1-14 | 2026-04-27 | Fringe balancing | 13:20 | transcript & video |
| 2-1 | 2026-04-27 | Move-to-root heuristics | 14:47 | transcript & video |
| 2-2 | 2026-04-28 | Move-to-Root Analysis | 41:24 | transcript & video |
| 2-3 | 2026-04-28 | Splay Trees | 19:14 | transcript & video |
| 2-4 | 2026-04-28 | Splay Tree Analysis prelude | 10:55 | transcript & video |
| 2-5 | 2026-05-04 | Splay Tree Analysis: Access Lemma | 34:39 | transcript & video |
| 2-6 | 2026-05-04 | Splay Tree Analysis: Adaptive Properties | 30:54 | transcript & video |
| 2-7 | 2026-05-05 | Biased Search Trees | 41:36 | transcript & video |
| 2-8 | 2026-05-05 | Online Algorithms and Competitive Analysis | 17:14 | transcript & video |
| 2-9 | 2026-05-05 | Dynamic Optimality I: The Splay Tree Conjecture | 9:49 | transcript & video |
| 2-10 | 2026-05-11 | Dynamic Optimality II: Properties of BSTs | 36:43 | transcript & video |
| 2-11 | 2026-05-11 | Geometric View of BSTs | 42:48 | transcript & video |
| 2-12 | 2026-05-12 | Geometric View of BSTs Proof Part 2 | 6:48 | transcript & video |
| 2-13 | 2026-05-12 | Online Greedy Arborally Satisfied Superset | 17:10 | transcript & video |
| 2-14 | 2026-05-12 | Independent Rectangle Lower Bound | 39:15 | transcript & video |
| 2-15 | 2026-05-12 | Deferred Data Structuring Motivation | 5:12 | transcript & video |
| 2-16 | 2026-05-18 | Recap Median-of-medians | 17:37 | transcript & video |
| 2-17 | 2026-05-18 | Multiple selection algorithms + adaptive lower bound | 25:22 | transcript & video |
| 2-18 | 2026-05-18 | Adaptive online multiple selection | 30:58 | transcript & video |
| 2-19 | 2026-05-19 | Lazy Search Trees | 42:39 | transcript & video |
| 2-20 | 2026-05-19 | Lazy Search Tree Invariants | 20:29 | transcript & video |
| 2-21 | 2026-05-19 | Lazy Search Trees Operations | 16:51 | transcript & video |
| 2-22 | 2026-05-26 | Lazy Search Tree Amortized Analysis | 1:00:15 | transcript & video |
| 3-1 | 2026-05-26 | Recap: Priority Queues and Binary Heaps | 13:38 | transcript & video |
| 3-2 | 2026-06-01 | Tournament Trees | 23:55 | transcript & video |
| 3-3 | 2026-06-01 | Lazy Partition Heaps | 26:48 | transcript & video |
| 3-4 | 2026-06-01 | Fibonacci Heaps – Informal Overview | 16:46 | transcript & video |
| 3-5 | 2026-06-01 | Quake Heaps Overview | 9:10 | transcript & video |
| 3-6 | 2026-06-02 | Quake Heaps Operations | 43:56 | transcript & video |
| 3-7 | 2026-06-02 | Quake Heaps Analysis | 28:33 | transcript & video |
| 4-1 | 2026-06-08 | Types of Persistent Data Structures | 6:10 | transcript & video |
| 4-2 | 2026-06-08 | Planar Point Location via Persistence | 21:39 | transcript & video |
| 4-3 | 2026-06-08 | Simple approaches to persistence | 20:58 | transcript & video |
| 4-4 | 2026-06-08 | Bounded in-degree linked data structures | 13:14 | transcript & video |
| 4-5 | 2026-06-08 | Partial persistence transformation transformation | 23:43 | transcript & video |
| 4-6 | 2026-06-09 | Partial Persistence Analysis | 52:13 | transcript & video |
| 5-1 | 2026-06-09 | Recap (universal) hashing | 27:10 | transcript & video |
| 5-2 | 2026-06-15 | Universal Hashing Guarantees | 12:48 | transcript & video |
| 5-3 | 2026-06-15 | Perfect Hashing | 27:52 | transcript & video |
| 5-4 | 2026-06-15 | Dynamic Perfect Hashing | 32:21 | transcript & video |
| 5-5 | 2026-06-16 | Binary Tries | 19:05 | transcript & video |
| 5-6 | 2026-06-16 | x-Fast Tries & y-Fast Tries | 32:02 | transcript & video |
| 5-7 | 2026-06-16 | Cell-Probe Lower Bounds | 27:51 | transcript & video |
| 5-7 | 2026-06-22 | Cell-Probe Lower Bounds 2 | 44:33 | transcript & video |
| 6-1 | 2026-06-22 | Computing over Compressed Data | 12:25 | transcript & video |
| 6-2 | 2026-06-22 | Bitvectors | 12:03 | transcript & video |
| 6-3 | 2026-06-29 | Rank-Index for Succinct Bitvectors | 39:27 | transcript & video |
| 6-4 | 2026-06-29 | Select-Index for Succinct Bitvectors | 30:19 | transcript & video |
| 6-5 | 2026-06-30 | Compressed Bitvectors | 48:09 | transcript & video |
| 6-6 | 2026-06-30 | MMPHF & Elias-Fano | 16:53 | transcript & video |
| 6-7 | 2026-06-30 | Wavelet trees | 16:20 | transcript & video |
| 6-8 | 2026-07-06 | Succinct Trees | 49:41 | transcript & video |
| 6-9 | 2026-07-06 | Graphs via Wavelet Trees | 11:23 | transcript & video |
| 7-1 | 2026-07-06 | External memory model, external sorting | 16:34 | transcript & video |
| 7-2 | 2026-07-07 | Basic External Memory Data Structures | 23:23 | transcript & video |
| 7-3 | 2026-07-07 | Basic External Memory Data Structures | 20:17 | transcript & video |
| 7-4 | 2026-07-07 | Cache-oblivious B-trees, vEB layout, file-maintenance | 35:20 | transcript & video |