| On the quantitative hardness of CVP H Bennett, A Golovnev, N Stephens-Davidowitz 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 13-24, 2017 | 50 | 2017 |
| Just How Hard Are Rotations of ? Algorithms and Cryptography with the Simplest Lattice H Bennett, A Ganju, P Peetathawatchai, N Stephens-Davidowitz Annual International Conference on the Theory and Applications of …, 2023 | 47* | 2023 |
| Fine-grained hardness of CVP (P)—Everything that we can prove (and nothing else) D Aggarwal, H Bennett, A Golovnev, N Stephens-Davidowitz Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 36 | 2021 |
| The complexity of the shortest vector problem H Bennett ACM SIGACT News 54 (1), 37-61, 2023 | 23 | 2023 |
| Planar minimization diagrams via subdivision with applications to anisotropic Voronoi diagrams H Bennett, E Papadopoulou, C Yap Computer Graphics Forum 35 (5), 229-247, 2016 | 22 | 2016 |
| Hardness of the (approximate) shortest vector problem: A simple proof via Reed-Solomon codes H Bennett, C Peikert arXiv preprint arXiv:2202.07736, 2022 | 16 | 2022 |
| Lattice problems beyond polynomial time D Aggarwal, H Bennett, Z Brakerski, A Golovnev, R Kumar, Z Li, S Peters, ... Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1516-1526, 2023 | 15 | 2023 |
| Improved hardness of BDD and SVP under Gap-(S) ETH H Bennett, C Peikert, Y Tang arXiv preprint arXiv:2109.04025, 2021 | 15 | 2021 |
| Amortized analysis of smooth quadtrees in all dimensions H Bennett, C Yap Computational Geometry 63, 20-39, 2017 | 15 | 2017 |
| Hardness of Bounded Distance Decoding on Lattices in Norms H Bennett, C Peikert arXiv preprint arXiv:2003.07903, 2020 | 14 | 2020 |
| Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms H Bennett, M Cheraghchi, V Guruswami, J Ribeiro Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 553-566, 2023 | 13 | 2023 |
| Relating code equivalence to other isomorphism problems H Bennett, KMH Win Designs, Codes and Cryptography 93 (3), 701-723, 2025 | 11 | 2025 |
| Model counting using the inclusion-exclusion principle H Bennett, S Sankaranarayanan International Conference on Theory and Applications of Satisfiability …, 2011 | 7* | 2011 |
| Asymptotic improvements to provable algorithms for the code equivalence problem H Bennett, D Bhatia, JF Biasse, M Durisheti, L LaBuff, VP Lavorante, ... Cryptology ePrint Archive, 2025 | 5 | 2025 |
| The more the merrier! on total coding and lattice problems and the complexity of finding multicollisions H Bennett, S Ghentiyala, N Stephens-Davidowitz 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), 14 …, 2025 | 5 | 2025 |
| On percolation and NP‐hardness H Bennett, D Reichman, I Shinkar Random Structures & Algorithms 54 (2), 228-257, 2019 | 5 | 2019 |
| On the lattice distortion problem H Bennett, D Dadush, N Stephens-Davidowitz arXiv preprint arXiv:1605.03613, 2016 | 4 | 2016 |
| Difficulties constructing lattices with exponential kissing number from codes H Bennett, A Golovnev, N Stephens-Davidowitz IEEE Transactions on Information Theory, 2025 | 2 | 2025 |
| Solving Random Low-Density Subset Sum Using Babai’s Algorithm H Bennett | 2 | 2022 |
| Graph Inference with Effective Resistance Queries H Bennett, M Black, A Nayyeri, E Warton arXiv preprint arXiv:2502.18350, 2025 | 1 | 2025 |
Noah Stephens-DavidowitzCornell UniversityVerified email at cornell.edu
