| Publication | Date of Publication | Type |
|---|
| The role of regularity in (hyper-)clique detection and implications for optimizing Boolean CSPs | 2026-09-29 | Paper |
| Near-optimal directed low-diameter decompositions | 2026-09-10 | Paper |
| A simple algorithm for trimmed multipoint evaluation | 2026-08-31 | Paper |
| Hardness of median and center in the Ulam metric | 2026-08-31 | Paper |
| A faster algorithm for constrained correlation clustering | 2026-06-24 | Paper |
Faster combinatorial k-clique algorithms
Algorithmica | 2026-06-17 | Paper |
| Faster minimization of tardy processing time on a single machine | 2026-03-18 | Paper |
| Minimizing tardy processing time on a single machine in near-linear time | 2026-01-14 | Paper |
| Deterministic 3SUM-hardness | 2025-11-04 | Paper |
Minimizing tardy processing time on a single machine in near-linear time
TheoretiCS | 2025-10-22 | Paper |
| Negative-weight single-source shortest paths in near-linear time: now faster! | 2025-08-15 | Paper |
| Can you solve closest string faster than exhaustive search? | 2025-01-06 | Paper |
| Dynamic dynamic time warping | 2024-11-28 | Paper |
| Faster sublinear-time edit distance | 2024-11-28 | Paper |
| Deterministic sparse pattern matching via the Baur-Strassen theorem | 2024-11-28 | Paper |
| The time complexity of fully sparse matrix multiplication | 2024-11-28 | Paper |
| The effect of sparsity on k-Dominating Set and related first-order graph properties | 2024-11-28 | Paper |
| Deterministic and Las Vegas algorithms for sparse nonnegative convolution | 2024-07-19 | Paper |
| A structural investigation of the approximability of polynomial-time problems | 2024-06-24 | Paper |
| Improved sublinear-time edit distance for preprocessed strings | 2024-06-24 | Paper |
| Faster combinatorial \(k\)-clique algorithms | 2024-05-31 | Paper |
| Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics | 2024-05-08 | Paper |
Almost-optimal sublinear-time edit distance in the low distance regime
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7768354 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Sparse nonnegative convolution is equivalent to dense nonnegative convolution
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties | 2022-07-27 | Paper |
Faster minimization of tardy processing time on a single machine
Algorithmica | 2022-05-03 | Paper |
The computational complexity of plethysm coefficients
Computational Complexity | 2021-05-25 | Paper |
Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
Journal of Logical and Algebraic Methods in Programming | 2018-12-19 | Paper |
