Scholar
Huck Bennett
Google Scholar ID: wP9F_v0AAAAJ
University of Colorado Boulder
Citations & Impact
Citations
239
H-index
9
i10-index
8
Publications
20
Co-authors
21
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Output-Sparse Matrix Multiplication Using Compressed Sensing (preprint)
- Graph Inference with Effective Resistance Queries (preprint)
- Asymptotic improvements to provable algorithms for the code equivalence problem (IEEE Trans. Inf. Theory, to appear)
- Difficulties Constructing Lattices with Exponential Kissing Number from Codes (IEEE Trans. Inf. Theory, 2025)
- Relating Code Equivalence to Other Isomorphism Problems (Designs, Codes and Cryptography, 2025)
- The more the merrier! On total coding and lattice problems and the complexity of finding multicollisions (ITCS 2025)
- Matrix Multiplication Verification Using Coding Theory (RANDOM 2024)
- Topological k-metrics (Discrete & Computational Geometry, to appear)
- Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all l_p Norms (SIAM J. Comput., 2024)
- Lattice Problems Beyond Polynomial Time (STOC 2023)
- The Complexity of the Shortest Vector Problem (ACM SIGACT News, 2023)
- Just how hard are rotations of Z^n? Algorithms and cryptography with the simplest lattice (EUROCRYPT 2023)
- Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes (RANDOM 2023)
- Improved Hardness of BDD and SVP Under Gap-(S)ETH (ITCS 2022)
- Reconstructing Weighted Voting Schemes from Partial Information about their Power Indices (COLT 2021)
- Fine-grained hardness of CVP(P)--- Everything that we can prove (and nothing else) (SODA 2021)
- Hardness of Bounded Distance Decoding on Lattices in l_p Norms (CCC 2020)
- An Enumeration Technique for Lattice Basis Reduction (preprint)
- On the Quantitative Hardness of CVP (FOCS 2017)
- On the Lattice Distortion Problem (ESA 2016)
Research Experience
- Currently an assistant professor at the University of Colorado Boulder. Formerly an assistant professor at Oregon State University, and a postdoc at the University of Michigan and Northwestern University.
Education
- Ph.D. from New York University; advisor information not provided.
Background
- Assistant professor in theoretical computer science, with a focus on lattices and geometric algorithms. Previously, he was an assistant professor at Oregon State University, did postdocs at the University of Michigan and Northwestern University, and completed his Ph.D. at New York University.
Miscellany
- Email address: huck.bennett@colorado.edu
