Seminar "Online Algorithms" WS 2026/27
Enrollment: if you want to take this seminar for the module INF-25-Ma-FTK-Sem “Seminar Theoretical Computer Science and Symbolic AI", please register by completing this survey and enrolling in our OPAL course. Otherwise, just enroll in the OPAL course.
Online Algorithms
An online algorithm is an algorithm that processes its input piece by piece, without having knowledge of it a priori (as it is the case with offline algorithms). Examples include the k-server, paging and ski rental problem.
Bibliography
- Amos Fiat and Gerhard J. Woeginger, Online Algorithms The State of the Art (Springer, 1998)
- Allan Borodin and Ran El-Yaniv, Online Computation and Competitive Analysis (Cambridge University Press, 2005)
The topics will be based on selected chapters from these textbooks and research articles.
The seminar is open to all students interested in algorithms and theoretical computer science. Prerequisites are some algorithmic background (successful completion of "Algorithmen und Datenstrukturen" or similar) and general mathematical maturity. The language of seminars is English.
The examination consists of a presentation (25-30 mins) on a selected topic, together with a discussion (10-15 mins). In addition, participants are expected to submit a short report on their selected topic, and to participate actively in the presentations of other students.
The first seminar will take place on Monday, October 19th 2026 at APB/3027 (slot 09:20-10:50).