Karl Bringmann
German theoretical computer scientist
From Wikipedia, the free encyclopedia
Karl Bringmann is a German theoretical computer scientist. He is currently senior researcher at Max Planck Institute for Informatics.
Karl Bringmann | |
|---|---|
| Alma mater | Saarland University |
| Awards | |
| Scientific career | |
| Fields | |
| Institutions | |
| Doctoral advisor | Kurt Mehlhorn |
| Website | people |
Biography
Bringmann earned his doctorate from Saarland University under the supervision of Kurt Mehlhorn.
In 2019, Bringmann received the Presburger Award from the European Association of Theoretical Computer Science for his work on lower bounds.[1] The same year, he received the Heinz Maier-Leibnitz Prize from the German Research Foundation for his work on fine-grained complexity and a near-linear pseudopolynomial time algorithm for the subset sum problem.[2] Furthermore, he was appointed as a professor at Saarland University.[3]
In March 2025, he was appointed as Full Professor of Theoretical Computer Science in the Department of Computer Science at the ETH Zurich.[4]