Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 305
66123, Saarbrücken
Germany
Email:
kbringmampi-inf.mpg.de
I am a coordinater at Max Planck Institute for Informatics. I am interested in theoretical computer science in general. More specifically, I study conditional lower bounds (e.g. based on the Strong Exponential Time Hypothesis) and algorithm design including but not limited to computational geometry. Previously, I stayed one year at ETH Zurich and four months at the Simons Institute for the Theory of Computing, Berkeley.
Winter 2016/17: Algorithms and Data Structures
Summer 2016: Complexity Theory of Polynomial-Time Problems
For a complete list of publications look here
[9] |
"Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve" FOCS'17: Proc. of the 57th Annual IEEE Symposium on Foundations of Computer Science |
[8] |
"A Dichotomy for Regular Expression Membership Testing" FOCS'17: Proc. of the 57th Annual IEEE Symposium on Foundations of Computer Science |
[7] |
"On Algebraic Branching Programs of Small Width" CCC'17: Proc. of the 32th Conference on Computational Complexity |
[6] |
"Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs" ICALP'17: Proc. of the 44th International Colloquium on Automata, Languages, and Programming |
[5] |
"A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum" SODA'17: Proc. of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms |
[4] |
FOCS'16: Proc. of the 56th Annual IEEE Symposium on Foundations of Computer Science |
[3] |
"Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping" FOCS'15: Proc. of the 55th Annual IEEE Symposium on Foundations of Computer Science |
[2] |
FOCS'14: Proc. of the 55th Annual IEEE Symposium on Foundations of Computer Science |
[1] | "Succinct Sampling from Discrete Distributions" STOC'13: Proc. of the 45th ACM Symposium on the Theory of Computing |