Welcome to the Algorithms group
The Algorithms group at the Institute of Theoretical Computer Science is headed by Prof. Dr. Christoph Berkholz since August 1, 2022.
Job offer: Student assistant (m/f/d) We are looking for you! |
Research
How can tasks be solved with few resources, and where is the limit of efficient solvability? The overall goal of the research in this area is to gain a deep understanding of the structure and complexity of algorithmic methods.
One focus is currently on counting and enumeration algorithms, which are investigated in the DFG project Representation Complexity of Counting and Enumeration Problems.
Teaching
The Algorithms group currently offers the following courses.
Winter term 2022/23
- Algorithms and Data Structures 2 (Bachelor) Module board, Moodle course
- Cryptography (Bachelor) Module board, Moodle course
- Efficient Algorithms (Master) Module board, Moodle course
- Proof Complexity (Master) Module board, Moodle course
Overview of all modules of the Institute of Theoretical Computer Science.