Isaac M. Hair

Orcid: 0000-0001-6992-4488

According to our database1, Isaac M. Hair authored at least 11 papers between 2024 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
List Recovery for Random Low-Rate Linear Codes.
CoRR, May, 2026

Public Key Encryption from High-Corruption Constraint Satisfaction Problems.
CoRR, April, 2026

Deterministic Hardness of Approximation For SVP in all Finite ℓ<sub>p</sub> Norms.
CoRR, April, 2026

SVP<i><sub>p</sub></i> Is Deterministically NP-Hard for All p > 2, Even to Approximate within a Factor of <i>2<sup>log<sup>1-ε</sup>n</sup></i>.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
SVP<sub>p</sub> is NP-Hard for all p > 2, Even to Approximate Within a Factor of 2<sup>{log<sup>1-ϵ</sup> n</sup>.
CoRR, November, 2025

SVP<sub>p</sub> is Deterministically NP-Hard for all p > 2, Even to Approximate Within a Factor of 2<sup>log<sup>1-ε</sup></sup> n.
IACR Cryptol. ePrint Arch., 2025

SVP$_p$ is NP-Hard for all $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\epsilon} n}$.
Electron. Colloquium Comput. Complex., 2025

Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy k-LIN over Expanders.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
The Case For Data Centre Hyperloops.
Proceedings of the 51st ACM/IEEE Annual International Symposium on Computer Architecture, 2024

Convex Polygon Containment: Improving Quadratic to Near Linear Time.
Proceedings of the 40th International Symposium on Computational Geometry, 2024


  Loading...