Teaching

Two lectures are closely associated with the group.

• Probability and Computing (every winter term) is concerned with the design of randomised algorithms and the mathematical tools for rigorously analysing their expected performance. Moreover, given the expertise of the group, we put special emphasis on randomised data structures such as hash tables, Bloom filters, retrieval data structures and perfect hash functions. All material from the lecture and exercises are freely available on the website of the most recent installment.
• Advanced Data Structures (starting summer 2026) is about designing data structures that are simultaneously fast in their operations and have small memory footprint. We look at many universally useful building blocks as well as how they can be combined into ellaborate solutions. Students are required to implement some of the presented ideas in a programming project. Their is a (german) website of a previous installment of this lecture as given by Florian Kurpicz.