The following dates are available:

12.08.2026
13.08.2026
14.08.2026
10.09.2026
11.09.2026
14.09.2026
15.09.2026
   
Please register with blancani∂kit edu, stating your full name, matriculation number, subject of study (Studienfach) and the version of the exam regulations (Version der Prüfungsordnung). Online registration starts on June 3, 2026, please register before your exam date. 

Programming Project: Github, submit via Ilias, discuss on Matrix

Ragnar's part: Lecture notes and slides.

• Overview: Slides / Text
• Models of Computation: Slides / Text
• Rank and Select: Slides / Text
• Elias-Fano coding: Slides / Text
• Succinct trees and planar graphs: Slides / Text
• Range minimum queries: Text (no slides)
• SimdQuickHeap: Blackboard / Blog / Preprint

Stefan's part: Slides only. The Handout-Version are exclude overlays and animations.

• Sorted Sequences: Fusion Trees and van Emde-Boas Trees: lecture-version / handout-version

In this lecture we consider modern data structures for fundamental objects such as integers, strings and graphs. These data structures are the basis for many applications and an important part of efficient algorithms. The course covers theoretical analysis but also aspects relevant for efficient performance in practice.

Data structures likely covered in the course are: rank-select, Elias Fano, succinct trees, segment trees, Cartesian tries, van Emde Boas trees, B-trees, fusion trees, y-fast-tries, set sketches, splay trees, absl::flat_hash_map funnel, funnel hashing.

Slides for the first 5 lectures can be found at https://curiouscoding.nl/teaching/.

Note that only the englisch variant of this website will be maintained.