Karl Bringmann

Papers

Total Citations

H-Index

About

Karl Bringmann is a leading figure in theoretical computer science, whose work bridges computational geometry, fine-grained complexity, and algorithm design. His research centers on understanding the fundamental limits of efficient computation, particularly for problems involving motion planning, dynamic data structures, and combinatorial optimization. Bringmann is perhaps best known for his groundbreaking contributions to the fine-grained complexity of problems like the 3SUM conjecture and the Strong Exponential Time Hypothesis (SETH), where he has established tight lower bounds that reshape our understanding of algorithmic efficiency. His work on motion planning, exemplified by the 2022 paper "Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds" (4 citations), tackles the challenge of coordinating multiple robots in a polygonal workspace, proving new separation bounds that simplify the problem’s complexity. Beyond this, his papers have garnered thousands of citations, reflecting their profound impact on both theory and practice. Bringmann has also received prestigious accolades, including an ERC Starting Grant, and his results on the hardness of dynamic graph problems and pattern matching are considered seminal in the field.