Computer Science 611
Spring 2005: Advanced Data Structures
Course Syllabus
-
Introduction. Data Structures for Priority Queues on a Fixed
Universe. Integer Data Structures. Beating the O(log n)
bound. O(log log n) time Priority Queues. Constant time Priority
Queues. van Emde Boas Trees. Fusion Trees.
(3 weeks)
-
Comparison-Based Data Structures. Self-Adjusting Data Structures.
Self-Organizing Sequential Structures. Move-to-Front and Transpose
algorithms. Order-by-Next-Request. Sleator-Tarjan and Munro Cost
Models.
(2 weeks)
-
Self-Adjusting Binary Search Trees. Splay Trees. Working-Set Property
and Dynamic Finger Property. Unified Structure. Amortized
Analysis. Dynamic Optimality Conjecture. O(log log n)-competitive
online BSTs.
(2 weeks)
-
Dynamic Graph Structures
(3 weeks)
Back to
Com S 611 homepage
This page was last modified on March 1, 2005.