| LEC # | TOPICS | STUDENT NOTES | PROFESSOR’S NOTES | VIDEOS |
|---|---|---|---|---|
| 1 |
Temporal: Class overview, pointer machine, partial persistence, full persistence, confluent persistence, functional |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 6.1MB) | Video |
| 2 |
Temporal: Partial retroactivity, full retroactivity, nonoblivious retroactivity |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.9MB) | Video |
| 3 |
Geometric: Point location via persistence, dynamic via retroactive; orthogonal range queries, range trees, layered range trees, dynamizing augmentation via weight balance, fractional cascading |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 6.3MB) | Video |
| 4 |
Geometric: O(log n) 3D orthogonal range searching via fractional cascading; kinetic data structures |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 6.1MB) | Video |
| 5 |
Dynamic optimality: Binary search trees, analytic bounds, splay trees, geometric view, greedy algorithm |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 6.5MB) | Video |
| 6 |
Dynamic optimality: Independent rectangle, wilber, and signed greedy lower bounds; key-independent optimality; O(lg lg n)-competitive tango trees |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.7MB) | Video |
| 7 |
Memory hierarchy: Models, cache-oblivious B-trees |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 7.1MB) | Video |
| 8 |
Memory hierarchy: Ordered-file maintenance, list labeling, order queries, cache-oblivious priority queues |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.5MB) | Video |
| 9 |
Memory hierarchy: Distribution sweeping via lazy funnelsort; cache-oblivious orthogonal 2D range searching: batched and online |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 6.5MB) | Video |
| 10 |
Dictionaries: Universal, k-wise independent, simple tabulation hashing; chaining, dynamic perfect hashing, linear probing, cuckoo hashing |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 6.0MB) | Video |
| 11 |
Integer: Models, predecessor problem, van Emde Boas, x-fast and y-fast trees, indirection |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.7MB) | Video |
| 12 |
Integer: Fusion trees: sketching, parallel comparison, most significant set bit |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.6MB) | Video |
| 13 |
Integer: Predecessor lower bound via round elimination |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.8MB) | Video |
| 14 |
Integer: Sorting in linear time for w = O(lg2+ε n), priority queues |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.8MB) | Video |
| 15 |
Static trees: Least common ancestor, range minimum queries, level ancestor |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.8MB) | Video |
| 16 |
Strings: Suffix tree, suffix array, linear-time construction for large alphabets, suffix tray, document retrieval |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF- 6.8MB) | Video |
| 17 |
Succinct: Rank, select, tries |
Student Notes (PDF)
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.5MB) | Video |
| 18 |
Succinct: Compact suffix arrays and trees |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 6.2MB) | Video |
| 19 |
Dynamic graphs: Link-cut trees, heavy-light decomposition |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 5.2MB) | Video |
| 20 |
Dynamic graphs: Euler tour trees, decremental connectivity in trees in O(1), fully dynamic connectivity in O(lg2 n), survey |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 7.4MB) | Video |
| 21 |
Dynamic graphs: Ω(lg n) lower bound for dynamic connectivity |
(Courtesy of MIT students. Used with permission.) |
Professor’s Notes (PDF - 4.6MB) | Video |
| 22 |
History of memory models: Idealized 2-level, red-blue pebble game, external memory, HMM, BT, (U)MH, cache oblivious [bonus lecture] |
Note: No student notes for this session. | Video |
Calendar and Notes
Course Info
Instructor
Departments
As Taught In
Spring
2012
Level
Course Info
Instructor
Departments
As Taught In
Spring
2012
Level
Learning Resource Types
Instructor Insights
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
