| Publication | Date of Publication | Type |
|---|
| Fast and simple modular subset sum | 2024-05-14 | Paper |
Submodular clustering in low dimensions
(available as arXiv preprint) | 2023-11-02 | Paper |
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
SIAM Journal on Computing | 2021-08-06 | Paper |
Fast modular subset sum using linear sketching
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Towards tight approximation bounds for graph diameter and eccentricities
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
If the current clique algorithms are optimal, so is Valiant's parser
SIAM Journal on Computing | 2018-12-19 | 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 |
Better approximations for tree sparsity in nearly-linear time
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Nearly-optimal bounds for sparse recovery in generic norms, with applications to \(k\)-median sketching
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
SIAM Journal on Computing | 2018-07-04 | Paper |
| Towards hardness of approximation for polynomial time problems | 2018-05-03 | Paper |
Better embeddings for planar earth-mover distance over sparse sets
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Constant-distortion embeddings of Hausdorff metrics into constant-dimensional \(\ell_p\) spaces | 2018-04-19 | Paper |
Tight hardness results for maximum weight rectangles
(available as arXiv preprint) | 2017-12-19 | Paper |
Optimal quantum query bounds for almost all Boolean functions
(available as arXiv preprint) | 2017-01-30 | Paper |
Search by quantum walks on two-dimensional grid without amplitude amplification
Theory of Quantum Computation, Communication, and Cryptography | 2015-12-03 | Paper |
Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Grover's algorithm with errors
Mathematical and Engineering Methods in Computer Science | 2015-08-05 | Paper |
Worst case analysis of non-local games
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Quantum strategies are better than classical in almost any XOR game
Automata, Languages, and Programming | 2013-08-12 | Paper |
