About Me
I am a researcher broadly interested in theoretical computer science. My specific research interests include fine-grained complexity and algorithm design, computational problems related to additive combinatorics, string algorithms, and algebraic methods.
Currently, I am a postdoc at Weizmann Institute of Science, where I am hosted by Amir Abboud. Before, I have completed my undergrad and PhD at Saarland University and Max Planck Institute for Informatics, advised by Karl Bringmann.
Publications
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time
Faster Combinatorial k-Clique Algorithms
Deterministic 3SUM-Hardness
The Time Complexity of Fully Sparse Matrix Multiplication
Faster Sublinear-Time Edit Distance
Dynamic Dynamic Time Warping
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
Can You Solve Closest String Faster than Exhaustive Search?
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics
Improved Sublinear-Time Edit Distance for Preprocessed Strings
A Structural Investigation of the Approximability of Polynomial-Time Problems
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution
Fine-Grained Completeness for Optimization in P
Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution
Faster Minimization of Tardy Processing Time on a Single Machine
A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties