| Karl Bringmann | |
| Alma Mater: | Saarland University |
| Thesis1 Title: | and |
| Thesis2 Title: | )--> |
| Thesis1 Url: | and |
| Thesis2 Url: | )--> |
| Thesis1 Year: | and |
| Thesis2 Year: | )--> |
| Doctoral Advisor: | Kurt Mehlhorn |
| Spouses: | )--> |
| Partners: | )--> |
Karl Bringmann is a German theoretical computer scientist. He is currently senior researcher at Max Planck Institute for Informatics.
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]