Advanced Data Structures

Summer semester 2026

Ragnar {Groot Koerkamp}, Stefan Walzer, Stefan Hermann

2026-04-20 Mon 14:00

curiouscoding.nl/teaching

Organizational matters

Lectures:

  • In English
  • Monday 14:00 - 15:30
  • Building 50.34, room 236

Grade:

  • 80% oral exam, 20 minutes
  • 20% programming project
    • Details coming a few weeks
    • Requires registration

Materials

This year's materials:

Previously taught by Florian Kurpicz:

Related MIT Advanced Data Structures course by Erik Demaine:

Tentative course overview

Ragnar (5 weeks):

  • Today: Models of computation
  • Rank & Select
  • Applications of Rank & Select:
    • Elias Fano
    • Succinct trees
    • Succinct planar graphs
  • Range minimum queries
    • Topic of practicum
  • Segment Trees & Fenwick Trees

Tentative course overview

Stefan Walzer & Stefan Hermann (6 [TODO] weeks):

  • Sorted sequences / predecessor structures
    • Van Emde Boas tree
    • x-Fast trie
    • y-Fast trie
  • External memory model
    • Cache-oblivious B-trees
  • Learned indexes
  • Streaming and Sketching algorithms
  • Splay trees
  • Modern hash tables

Social time!