Follow
Huck Bennett
Title
Cited by
Cited by
Year
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
302017
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
192021
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
192016
Amortized analysis of smooth quadtrees in all dimensions
H Bennett, C Yap
Computational Geometry 63, 20-39, 2017
122017
Model counting using the inclusion-exclusion principle
H Bennett, S Sankaranarayanan
International Conference on Theory and Applications of Satisfiability …, 2011
62011
Improved hardness of BDD and SVP under Gap-(S) ETH
H Bennett, C Peikert, Y Tang
arXiv preprint arXiv:2109.04025, 2021
42021
On percolation and NP‐hardness
H Bennett, D Reichman, I Shinkar
Random Structures & Algorithms 54 (2), 228-257, 2019
42019
Just how hard are rotations of ? Algorithms and cryptography with the simplest lattice
H Bennett, A Ganju, P Peetathawatchai, N Stephens-Davidowitz
Cryptology ePrint Archive, 2021
32021
Hardness of Bounded Distance Decoding on Lattices in Norms
H Bennett, C Peikert
arXiv preprint arXiv:2003.07903, 2020
32020
On the lattice distortion problem
H Bennett, D Dadush, N Stephens-Davidowitz
arXiv preprint arXiv:1605.03613, 2016
22016
Counting problems and the inclusion-exclusion principle
S Sankaranarayanan, H Bennett
Technical report, Department of Computer Science, University of Colorado …, 2012
12012
Lattice Problems Beyond Polynomial Time
D Aggarwal, H Bennett, Z Brakerski, A Golovnev, R Kumar, Z Li, S Peters, ...
arXiv preprint arXiv:2211.11693, 2022
2022
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all Norms
H Bennett, M Cheraghchi, V Guruswami, J Ribeiro
arXiv preprint arXiv:2211.07900, 2022
2022
Lattice Algorithms for Integer Programming
H Bennett
2022
Solving Random Low-Density Subset Sum Using Babai’s Algorithm
H Bennett
2022
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes
H Bennett, C Peikert
arXiv preprint arXiv:2202.07736, 2022
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
Amortized Analysis of Balanced Quadtrees
H Bennett, C Yap
2013
The system can't perform the operation now. Try again later.
Articles 1–20