| 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 | 33 | 2017 |
| 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 | 22 | 2021 |
| 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 | 21 | 2016 |
| Amortized analysis of smooth quadtrees in all dimensions H Bennett, C Yap Computational Geometry 63, 20-39, 2017 | 13 | 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 | 9 | 2023 |
| Improved hardness of BDD and SVP under Gap-(S) ETH H Bennett, C Peikert, Y Tang arXiv preprint arXiv:2109.04025, 2021 | 6 | 2021 |
| Hardness of Bounded Distance Decoding on Lattices in Norms H Bennett, C Peikert arXiv preprint arXiv:2003.07903, 2020 | 6 | 2020 |
| Model counting using the inclusion-exclusion principle H Bennett, S Sankaranarayanan International Conference on Theory and Applications of Satisfiability …, 2011 | 6* | 2011 |
| Hardness of the (approximate) Shortest Vector Problem: A simple proof via Reed-Solomon codes H Bennett, C Peikert arXiv preprint arXiv:2202.07736, 2022 | 5 | 2022 |
| 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 | 2 | 2016 |
| 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 | 1 | 2023 |
| Solving Random Low-Density Subset Sum Using Babai’s Algorithm H Bennett | 1 | 2022 |
| Topological -metrics W Barkan-Vered, H Bennett, A Nayyeri arXiv preprint arXiv:2308.04609, 2023 | | 2023 |
| 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 | | 2023 |
| The Complexity of the Shortest Vector Problem H Bennett ACM SIGACT News 54 (1), 37-61, 2023 | | 2023 |
| Lattice Algorithms for Integer Programming H Bennett | | 2022 |
| Reconstructing weighted voting schemes from partial information about their power indices H Bennett, A De, R Servedio, EV Vlatakis-Gkaragkounis Conference on Learning Theory, 500-565, 2021 | | 2021 |
| A Block Enumeration Technique for Lattice Basis Reduction H Bennett | | 2018 |
| A subdivision approach to weighted voronoi diagrams H Bennett, E Papadopoulou, C Yap 24th Annual Fall Workshop on Computational Geometry (FWCG). Oct. 31-Nov. 1 …, 2014 | | 2014 |
Noah Stephens-DavidowitzCornell UniversityVerified email at cornell.edu
