On the Lattice Distortion Problem. - Huck Bennett; Daniel Dadush; Noah Stephens-Davidowitz (ESA, 2016)

On Percolation and NP-Hardness. - Huck Bennett; Daniel Reichman 001; Igor Shinkar (ICALP, 2016)

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. - Huck Bennett; Evanthia Papadopoulou; Chee Yap (Comput. Graph. Forum, 2016)

On the Quantitative Hardness of CVP. - Huck Bennett; Alexander Golovnev; Noah Stephens-Davidowitz (FOCS, 2017)

Amortized analysis of smooth quadtrees in all dimensions. - Huck Bennett; Chee Yap (Comput. Geom., 2017)

On percolation and -hardness. - Huck Bennett; Daniel Reichman 001; Igor Shinkar (Random Struct. Algorithms, 2019)

Hardness of Bounded Distance Decoding on Lattices in ℓp Norms. - Huck Bennett; Chris Peikert (CCC, 2020)

Reconstructing weighted voting schemes from partial information about their power indices. - Huck Bennett; Anindya De; Rocco A. Servedio; Emmanouil-Vasileios Vlatakis-Gkaragkounis (COLT, 2021)

Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). - Divesh Aggarwal; Huck Bennett; Alexander Golovnev; Noah Stephens-Davidowitz (SODA, 2021)

Just how hard are rotations of ℤn? Algorithms and cryptography with the simplest lattice. - Huck Bennett; Atul Ganju; Pura Peetathawatchai; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2021)

Improved Hardness of BDD and SVP Under Gap-(S)ETH. - Huck Bennett; Chris Peikert; Yi Tang (ITCS, 2022)

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms. - Huck Bennett; Mahdi Cheraghchi; Venkatesan Guruswami; João Ribeiro 002 (Electron. Colloquium Comput. Complex., 2022)

Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. - Huck Bennett; Chris Peikert (APPROX/RANDOM, 2023)

Just How Hard Are Rotations of $ mathbb {Z}^n$? Algorithms and Cryptography with the Simplest Lattice. - Huck Bennett; Atul Ganju; Pura Peetathawatchai; Noah Stephens-Davidowitz (EUROCRYPT (5), 2023)

Lattice Problems beyond Polynomial Time. - Divesh Aggarwal; Huck Bennett; Zvika Brakerski; Alexander Golovnev; Rajendra Kumar 002; Zeyong Li; Spencer Peters; Noah Stephens-Davidowitz; Vinod Vaikuntanathan (STOC, 2023)

Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms. - Huck Bennett; Mahdi Cheraghchi; Venkatesan Guruswami; João Ribeiro 002 (STOC, 2023)

The Complexity of the Shortest Vector Problem. - Huck Bennett (SIGACT News, 2023)

Matrix Multiplication Verification Using Coding Theory. - Huck Bennett; Karthik Gajulapalli; Alexander Golovnev; Philip G. Warton (APPROX/RANDOM, 2024)

Topological k-Metrics. - Willow Barkan-Vered; Huck Bennett; Amir Nayyeri (SoCG, 2024)

Difficulties Constructing Lattices with Exponential Kissing Number from Codes. - Huck Bennett; Alexander Golovnev; Noah Stephens-Davidowitz (CoRR, 2024)

The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices. - Huck Bennett; Surendra Ghentiyala; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2024)

Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ({ ell_{{p}}} ) Norms. - Huck Bennett; Mahdi Cheraghchi; Venkatesan Guruswami; João Ribeiro 002 (SIAM J. Comput., 2024)

The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding Multicollisions. - Huck Bennett; Surendra Ghentiyala; Noah Stephens-Davidowitz (ITCS, 2025)

Asymptotic improvements to provable algorithms for the code equivalence problem. - Huck Bennett; Drisana Bhatia; Jean-François Biasse; Medha Durisheti; Lucas LaBuff; Vincenzo Pallozzi Lavorante; Phillip Waitkevich (IACR Cryptol. ePrint Arch., 2025)

Graph Inference with Effective Resistance Queries. - Huck Bennett; Mitchell Black 002; Amir Nayyeri; Philip G. Warton (CoRR, 2025)

Relating code equivalence to other isomorphism problems. - Huck Bennett; Kaung Myat Htay Win (Des. Codes Cryptogr., 2025)