| Edit distance cannot be computed in strongly subquadratic time (unless SETH is false) A Backurs, P Indyk Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 417 | 2015 |
| Tight hardness results for LCS and other sequence similarity measures A Abboud, A Backurs, VV Williams 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 59-78, 2015 | 296* | 2015 |
| Scalable fair clustering A Backurs, P Indyk, K Onak, B Schieber, A Vakilian, T Wagner International Conference on Machine Learning, 405-413, 2019 | 200 | 2019 |
| Differentially private fine-tuning of language models D Yu, S Naik, A Backurs, S Gopi, HA Inan, G Kamath, J Kulkarni, YT Lee, ... arXiv preprint arXiv:2110.06500, 2021 | 153 | 2021 |
| If the current clique algorithms are optimal, so is Valiant's parser A Abboud, A Backurs, VV Williams SIAM Journal on Computing 47 (6), 2527-2555, 2018 | 127 | 2018 |
| Which regular expression patterns are hard to match? A Backurs, P Indyk 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 100 | 2016 |
| Towards tight approximation bounds for graph diameter and eccentricities A Backurs, L Roditty, G Segal, VV Williams, N Wein Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 65 | 2018 |
| Space and time efficient kernel density estimation in high dimensions A Backurs, P Indyk, T Wagner Advances in neural information processing systems 32, 2019 | 57 | 2019 |
| Tight hardness results for maximum weight rectangles A Backurs, N Dikkala, C Tzamos arXiv preprint arXiv:1602.05837, 2016 | 52 | 2016 |
| Scalable nearest neighbor search for optimal transport A Backurs, Y Dong, P Indyk, I Razenshteyn, T Wagner International Conference on machine learning, 497-506, 2020 | 50 | 2020 |
| Subtree isomorphism revisited A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018 | 50 | 2018 |
| Search by quantum walks on two-dimensional grid without amplitude amplification A Ambainis, A Bačkurs, N Nahimovs, R Ozols, A Rivosh Conference on Quantum Computation, Communication, and Cryptography, 87-97, 2012 | 48 | 2012 |
| Improving viterbi is hard: Better runtimes imply faster clique algorithms A Backurs, C Tzamos International Conference on Machine Learning, 311-321, 2017 | 45 | 2017 |
| Fine-grained complexity of analyzing compressed data: Quantifying improvements over decompress-and-solve A Abboud, A Backurs, K Bringmann, M Künnemann 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 39 | 2017 |
| Better approximations for tree sparsity in nearly-linear time A Backurs, P Indyk, L Schmidt Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 38 | 2017 |
| On the fine-grained complexity of empirical risk minimization: Kernel methods and neural networks A Backurs, P Indyk, L Schmidt Advances in Neural Information Processing Systems 30, 2017 | 38 | 2017 |
| Towards hardness of approximation for polynomial time problems A Abboud, A Backurs 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017 | 37 | 2017 |
| Unveiling transformers with lego: a synthetic reasoning task Y Zhang, A Backurs, S Bubeck, R Eldan, S Gunasekar, T Wagner arXiv preprint arXiv:2206.04301, 2022 | 36 | 2022 |
| Efficient density evaluation for smooth kernels A Backurs, M Charikar, P Indyk, P Siminelakis 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 28 | 2018 |
| Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching A Backurs, P Indyk, I Razenshteyn, DP Woodruffs Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 20 | 2016 |
