Huck Bennett
Affiliations:- Oregon State University, OR, USA
According to our database1,
Huck Bennett
authored at least 23 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
4
1
1
1
1
1
1
2
4
1
2
1
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) Norms.
SIAM J. Comput., 2024
IACR Cryptol. ePrint Arch., 2024
The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices.
Electron. Colloquium Comput. Complex., 2024
CoRR, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
Proceedings of the Approximation, 2024
2023
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓ<i><sub>p</sub></i> Norms.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Just How Hard Are Rotations of $\mathbb {Z}^n$? Algorithms and Cryptography with the Simplest Lattice.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes.
Proceedings of the Approximation, 2023
2022
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓ<sub>p</sub> Norms.
Electron. Colloquium Comput. Complex., 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
2021
Just how hard are rotations of ℤ<sup>n</sup>? Algorithms and cryptography with the simplest lattice.
IACR Cryptol. ePrint Arch., 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Reconstructing weighted voting schemes from partial information about their power indices.
Proceedings of the Conference on Learning Theory, 2021
2020
Proceedings of the 35th Computational Complexity Conference, 2020
2019
2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams.
Comput. Graph. Forum, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016