| Publication | Date of Publication | Type |
|---|
| New algorithms for pigeonhole equal subset sum (edit) | 2026-08-31 | Paper |
| Faster algorithms for bounded tree edit distance | 2026-05-12 | Paper |
| An improved sketching algorithm for edit distance | 2026-04-21 | Paper |
| A faster algorithm for pigeonhole equal sums | 2026-01-14 | Paper |
| Streaming algorithms for connectivity augmentation | 2026-01-14 | Paper |
| A VLSI circuit model accounting for wire delay | 2025-11-04 | Paper |
| Approximation algorithms and hardness for n-pairs shortest paths and all-nodes shortest cycles | 2025-08-15 | Paper |
| Faster algorithms for text-to-pattern Hamming distances | 2025-08-15 | Paper |
| Constructive separations and their consequences | 2025-08-13 | Paper |
| Hardness magnification for all sparse NP languages | 2025-08-12 | Paper |
Quantum speed-ups for string synchronizing sets, longest common substring, and k-mismatch matching
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Improved roundtrip spanners, emulators, and directed girth approximation | 2024-11-28 | Paper |
| Near-optimal quantum algorithms for bounded edit distance and Lempel-Ziv factorization | 2024-11-28 | Paper |
| An efficient algorithm for all-pairs bounded edge connectivity | 2024-11-14 | Paper |
| A simple near-linear pseudopolynomial time randomized algorithm for subset sum | 2024-08-26 | Paper |
| Near-optimal quantum algorithms for string problems | 2024-07-19 | Paper |
| Truly low-space element distinctness and subset sum via pseudorandom hash functions | 2024-07-19 | Paper |
Constructive separations and their consequences
TheoretiCS | 2024-07-03 | Paper |
| Listing 6-cycles | 2024-05-29 | Paper |
| Fast and simple modular subset sum | 2024-05-14 | Paper |
| Quantum speed-ups for string synchronizing sets, longest common substring, and \(k\)-mismatch matching | 2024-05-14 | Paper |
| Approximating Knapsack and partition via dense subset sums | 2024-05-14 | Paper |
| Removing additive structure in 3SUM-based reductions | 2024-05-08 | Paper |
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Algorithmica | 2024-04-24 | Paper |
| scientific article; zbMATH DE number 7829235 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788444 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Tight dynamic problem lower bounds from generalized BMM and OMv
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Improved MPC algorithms for MIS, matching, and coloring on trees and beyond | 2023-11-02 | Paper |
Improved Merlin-Arthur protocols for central problems in fine-grained complexity
Algorithmica | 2023-08-17 | Paper |
Near-optimal quantum algorithms for string problems
Algorithmica | 2023-08-17 | Paper |
scientific article; zbMATH DE number 7561569 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Faster Algorithms for All Pairs Non-Decreasing Paths Problem
(available as arXiv preprint) | 2022-07-21 | Paper |
Simulating random walks on graphs in the streaming model
(available as arXiv preprint) | 2022-07-18 | Paper |
Sharp threshold results for computational complexity
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Fast modular subset sum using linear sketching
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
