| Publication | Date of Publication | Type |
|---|
| Testing sumsets is hard | 2026-08-31 | Paper |
| Breaking the 2ⁿ barrier for 5-coloring and 6-coloring | 2026-05-12 | Paper |
| Optimal non-adaptive cell probe dictionaries and hashing | 2026-01-14 | Paper |
| Planting undetectable backdoors in machine learning models (extended abstract) | 2025-08-15 | Paper |
| Tight space complexity of the coin problem | 2025-08-13 | Paper |
| Random k-out subgraph leaves only O(n/k) inter-component edges | 2025-08-12 | Paper |
| Faster algorithm for unique (k,2)-CSP | 2025-06-19 | Paper |
Essentially tight bounds for rainbow cycles in proper edge-colourings
Proceedings of the London Mathematical Society. Third Series | 2025-04-25 | Paper |
Sumsets in the hypercube
SIAM Journal on Discrete Mathematics | 2025-02-07 | Paper |
| The wrong direction of Jensen's inequality is algorithmically right | 2024-11-14 | Paper |
| Selection from heaps, row-sorted matrices, and X+Y using soft heaps | 2024-08-26 | Paper |
| Simulating a stack using queues | 2024-07-19 | Paper |
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Essentially tight bounds for rainbow cycles in proper edge-colourings | 2023-09-08 | Paper |
| Algorithmic Applications of Hypergraph and Partition Containers | 2022-11-21 | Paper |
| Dynamic ordered sets with approximate queries, approximate heaps and soft heaps | 2022-07-21 | Paper |
| Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering | 2021-07-05 | Paper |
Faster k-SAT algorithms using biased-PPSZ
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
A sort of an adversary
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Subtree isomorphism revisited
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Subtree isomorphism revisited
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6829368 (Why is no real title available?) | 2018-01-24 | Paper |
The amortized cost of finding the minimum
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Sumsets in the Hypercube
(available as arXiv preprint) | N/A | Paper |
Testing Sumsets is Hard
(available as arXiv preprint) | N/A | Paper |
