Advanced Data Structures
László Kozma
Comments
Efficient data structures are important components of all nontrivial algorithms, and are basic building blocks of the modern computing infrastructure. Besides their practical importance, the design and analysis of data structures has revealed a rich mathematical theory. The ultimate theoretical limits of data structures are the subject of deep open questions.
The topic of this course is the design and analysis of advanced data structures (including both classical and recent results).
An earlier course with a similar selection of topics can be seen here:
https://page.mi.fu-berlin.de/lkozma/ds2020
Familiarity with algorithmic and relevant mathematical concepts is assumed (e.g., the course "Advanced algorithms" or similar as a prerequisite).
close
Suggested reading
D. E. Knuth, The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1. (Addison-Wesley, 2011), xv+883pp. ISBN 0-201-03804-8
close32 Class schedule
Regular appointments
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)
Location:
T9/049 Seminarraum (Takustr. 9)