Karl Bringmann

Professor, Max Planck Institute for Informatics
Karl Bringmann finished his PhD at Max Planck Institute for Informatics and Saarland University in 2014. After postdoc stays at ETH Zurich and the Simons Institute for the Theory of Computing, he was a Senior Researcher at Max Planck Institute for Informatics from 2016-19. In 2019 he became a full professor at Saarland University. He is on the editorial board of SICOMP. In his research he proves conditional lower bounds in fine-grained complexity, and designs algorithms for combinatorial problems on graphs, strings, and numbers.

Program Visits

Logic and Algorithms in Database Theory and AI, Fall 2023, Visiting Scientist
Fine-Grained Complexity and Algorithm Design, Fall 2015, Qualcomm Research Fellow
Website Opens new tab
Fields
fine-grained complexity, combinatorial problems on graphs, optimization, randomized algorithms