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
232017
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
152016
Amortized analysis of smooth quadtrees in all dimensions
H Bennett, C Yap
Computational Geometry 63, 20-39, 2017
102017
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
92021
Model counting using the inclusion-exclusion principle
H Bennett, S Sankaranarayanan
International Conference on Theory and Applications of Satisfiability …, 2011
62011
On percolation and NP‐hardness
H Bennett, D Reichman, I Shinkar
Random Structures & Algorithms 54 (2), 228-257, 2019
32019
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
Reconstructing weighted voting schemes from partial information about their power indices
H Bennett, A De, RA Servedio, EV Vlatakis-Gkaragkounis
arXiv preprint arXiv:2007.09599, 2020
2020
Hardness of Bounded Distance Decoding on Lattices in 𝓁_p Norms
H Bennett, C Peikert
35th Computational Complexity Conference (CCC 2020), 2020
2020
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–13