default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuck Bennett
Person information
- affiliation: Oregon State University, OR, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) Norms. SIAM J. Comput. 53(5): 1439-1475 (2024)- [c14]Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Philip G. Warton:
Matrix Multiplication Verification Using Coding Theory. APPROX/RANDOM 2024: 42:1-42:13 - [c13]Willow Barkan-Vered, Huck Bennett, Amir Nayyeri:
Topological k-Metrics. SoCG 2024: 13:1-13:13 - [i16]Huck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz:
The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices. Electron. Colloquium Comput. Complex. TR24 (2024) - [i15]Huck Bennett, Kaung Myat Htay Win:
Relating Code Equivalence to Other Isomorphism Problems. IACR Cryptol. ePrint Arch. 2024: 782 (2024) - 2023
- [j4]Huck Bennett:
The Complexity of the Shortest Vector Problem. SIGACT News 54(1): 37-61 (2023) - [c12]Huck Bennett, Chris Peikert:
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. APPROX/RANDOM 2023: 37:1-37:20 - [c11]Huck Bennett, Atul Ganju, Pura Peetathawatchai, Noah Stephens-Davidowitz:
Just How Hard Are Rotations of $\mathbb {Z}^n$? Algorithms and Cryptography with the Simplest Lattice. EUROCRYPT (5) 2023: 252-281 - [c10]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro
:
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms. STOC 2023: 553-566 - [c9]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems beyond Polynomial Time. STOC 2023: 1516-1526 - [i14]Willow Barkan-Vered, Huck Bennett, Amir Nayyeri:
Topological k-metrics. CoRR abs/2308.04609 (2023) - [i13]Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Philip G. Warton:
Matrix Multiplication Verification Using Coding Theory. CoRR abs/2309.16176 (2023) - 2022
- [c8]Huck Bennett, Chris Peikert, Yi Tang:
Improved Hardness of BDD and SVP Under Gap-(S)ETH. ITCS 2022: 19:1-19:12 - [i12]Huck Bennett, Chris Peikert:
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. CoRR abs/2202.07736 (2022) - [i11]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all 𝓁p Norms. CoRR abs/2211.07900 (2022) - [i10]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems Beyond Polynomial Time. CoRR abs/2211.11693 (2022) - [i9]Huck Bennett:
The Complexity of the Shortest Vector Problem. Electron. Colloquium Comput. Complex. TR22 (2022) - [i8]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c7]Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Reconstructing weighted voting schemes from partial information about their power indices. COLT 2021: 500-565 - [c6]Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). SODA 2021: 1816-1835 - [i7]Huck Bennett, Chris Peikert, Yi Tang:
Improved Hardness of BDD and SVP Under Gap-(S)ETH. CoRR abs/2109.04025 (2021) - [i6]Huck Bennett, Atul Ganju, Pura Peetathawatchai, Noah Stephens-Davidowitz:
Just how hard are rotations of ℤn? Algorithms and cryptography with the simplest lattice. IACR Cryptol. ePrint Arch. 2021: 1548 (2021) - 2020
- [c5]Huck Bennett, Chris Peikert:
Hardness of Bounded Distance Decoding on Lattices in ℓp Norms. CCC 2020: 36:1-36:21 - [i5]Huck Bennett, Chris Peikert:
Hardness of Bounded Distance Decoding on Lattices in 𝓁p Norms. CoRR abs/2003.07903 (2020) - [i4]Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Reconstructing weighted voting schemes from partial information about their power indices. CoRR abs/2007.09599 (2020)
2010 – 2019
- 2019
- [j3]Huck Bennett, Daniel Reichman, Igor Shinkar:
On percolation and -hardness. Random Struct. Algorithms 54(2): 228-257 (2019) - [i3]Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). CoRR abs/1911.02440 (2019) - 2017
- [j2]Huck Bennett, Chee Yap:
Amortized analysis of smooth quadtrees in all dimensions. Comput. Geom. 63: 20-39 (2017) - [c4]Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
On the Quantitative Hardness of CVP. FOCS 2017: 13-24 - [i2]Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
On the Quantitative Hardness of CVP. CoRR abs/1704.03928 (2017) - 2016
- [j1]Huck Bennett, Evanthia Papadopoulou, Chee Yap:
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. Comput. Graph. Forum 35(5): 229-247 (2016) - [c3]Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz:
On the Lattice Distortion Problem. ESA 2016: 9:1-9:17 - [c2]Huck Bennett, Daniel Reichman, Igor Shinkar:
On Percolation and NP-Hardness. ICALP 2016: 80:1-80:14 - [i1]Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz:
On the Lattice Distortion Problem. CoRR abs/1605.03613 (2016) - 2014
- [c1]Huck Bennett, Chee Yap:
Amortized Analysis of Smooth Quadtrees in All Dimensions. SWAT 2014: 38-49
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-24 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
