LE/EECS 4101
Advanced Data Structures
Fall 2024
Topics
- Amortized analysis
- dynamic tables
- binomial and Fibonacci heaps
- union–find
- binary search trees
- red–black trees
- augmented structures
- B-trees
- hashing
- lock-free data structures
Readings
- Listed text: Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms, 4th ed. (2022); 3rd ed. accepted.
- References: Brass, Advanced Data Structures; Graham, Knuth and Patashnik, Concrete Mathematics, 2nd ed.; Herlihy et al., The Art of Multiprocessor Programming, 2nd ed.; Morin, Open Data Structures; Navarro, Compact Data Structures; Samet, Foundations of Multidimensional and Metric Data Structures; Shaffer, Data Structures and Algorithm Analysis; Solow, How to Read and Do Proofs, 6th ed.
Sources
- Course catalogue ↗2026–2027
- Public course website / syllabus ↗Fall 2024
- Combined outline also covers GS/EECS 5101.