Skip to
main content
or
main navigation
Institute
D1
Algorithms and Complexity
D2
Computer Vision and Machine Learning
D3
Internet Architecture
D4
Computer Graphics
D5
Databases and Information Systems
D6
Visual Computing and Artificial Intelligence
RG1
Automation of Logic
RG2
Network and Cloud Systems
RG3
Multimodal Language Processing
Algorithms and Complexity
Algorithm Office Hours
People
Former Members
Research
Algorithmic Game Theory
Approximation Algorithms
Fine-Grained Complexity and Algorithm Design
Graph Algorithms
Optimization
Parameterized and Counting Algorithms and Complexity
Robust Learning
String Algorithms and Data Compression
Offers
Postdoc Application
Joint Algorithms Research Fellowships with Research Groups at ETH Zurich, ISTA, and IISc
Teaching
Summer 2026
Algorithms and Data Structures
Discrete Optimization
Winter 2025/26
Randomized and Approximation Algorithms
Summer 2025
Discrete Optimization
Mechanism Design Without Money
Winter 2024/25
Introduction to Algorithms and Data Structures
Summer 2024
Fine-Grained Complexity Theory
Topics in Computational Social Choice Theory
Discrete Optimization
Winter 2023/24
Algorithms and Data Structures
Sublinear Algorithms
Ideen und Konzepte der Informatik
Summer 2023
Techniques for Counting Problems
Parametrized Algorithms (external)
Seminar: Foundations of Machine Learning
Winter 2022/23
Randomized Algorithms and Probabilistic Analysis of Algorithms
Approximation Algorithms
Ideen und Konzepte der Informatik
Summer 2022
Winter 2021/22
Summer 2021
Winter 2020/21
Summer 2020
Winter 2019/20
Summer 2019
Winter 2018/19
Summer 2018
Seminars
Just Beyond P
Algorithms with Predictions
Quantum Lecture Series
Virtual Theory Seminar
Publications
Current Year
Last Year
The Year Before Last
Reports
ADFOCS
26th Max Planck Advanced Course on the Foundations of Computer Science
Welcome
Program
Registration
Accommodation
History
Code of Conduct
News
Departments
Algorithms and Complexity
People
Maximilian Thiessen
