Beating the Worst Case

Lecturers: Jean-Pierre, Marcus
Slots: 12
Registration: Register by sending your name and matriculation number via email to Jean-Pierre heydt@kit.edu, or simply come to the first meeting (first come, first served)

In the practical course Beating the Worst Case in Practice: Unexpectedly Efficient Algorithms, we focus on algorithms that are significantly more efficient on real-world instances than theoretical worst-case analyses would suggest. This unexpected efficiency is investigated empirically during the course. For this purpose, we provide different algorithmic approaches and problems, which the students independently implement and evaluate.

There are two phases. In the first phase, participants are gradually introduced to the empirical analysis of an algorithmic problem using exercise sheets. The second phase consists of a project, where the students independently investigate another topic, applying the skills gained during the first phase. Work is carried out in small teams.

GitLab: Framework Repository on Gitlab

Slides: will be uploaded on this website.