6.897: Advanced Data Structures (Spring 2003)

Prof. Erik Demaine

[Home] [General motivation] [Requirements] [Projects] [Scribe notes] [Erik's notes] [Email archive] [Accessibility]


This class will cover a variety of topics, which can vary depending on interest by students. Big topics that will be covered include compression, search trees, text indexing, static data structures, succinct (small) data structures, "bit tricks", and cache-efficient data structures. To get a better feel for the area, I've written some general motivation for advanced data structures.


Lecture Time: Mondays and Wednesdays at 11:00am-12:30pm
Lecture Room: 24-121
First Lecture: Monday, February 10, 2003

Units: 3-0-9
Prerequisites: 6.046 or equivalent background in algorithms and basic data structures
Credit: H-level and EC-level credit; no ED credit
Requirements: Scribe a few lectures, research-oriented project, and short presentation. Details.


If you are interested in attending the class, send me email to join the mailing list for course information. Further details will also be posted on this webpage.