| Course | Type | Frequency | Lecturer |
|---|---|---|---|
| Complexity Theory | Lecture | Every two years (odd) in WS | Vollmer |
| Computability and Logic | Lecture | Every two years (odd) in SS | Vollmer |
| Cryptography | Lecture | Every two years (even) in WS | Meier |
| Efficient Algorithms | Lecture | Every two years (odd) in WS | Meier |
| Formal Languages | Lecture | Every two years (odd) in SS | Meier |
| Logic and Complexity | Lecture | Every two years (even) in SS | Meier |
| Parameterized Complexity Theory | Lecture | Every two years (even) in WS | Vollmer |
| Quantum Computing | Lecture | once in WS25/26 | Egly |
| Theory of Boolean Circuits | Lecture | Every two years (even) in SS | Vollmer |