Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Isaac M. Hair
Observed names:
Hair, Isaac M,
Hair, Isaac M.
Institutions:
University of California, Santa Barbara,
University of California, Los Angeles,
Carnegie Mellon University
Observed institutions:
University of California, Santa Barbara,
University of California, Los Angeles,
Carnegie Mellon University
ORCID:
0000-0001-6992-4488
Observed ORCID:
0000-0001-6992-4488
OpenAlex ID:
A5118263102
Deterministic Hardness of Approximation For SVP in all Finite $\ell_p$ Norms
2026
·
Hair, Isaac M
, Sahai, Amit
·
arXiv (Cornell University)
·
8
PDF
SVP p Is Deterministically NP-Hard for All p > 2, Even to Approximate within a Factor of 2 log 1-ε n
2026
·
Isaac M. Hair
, Amit Sahai
·
ACM Symposium on Theory of Computing (STOC)
·
6
Bellman-Ford in Almost-Linear Time
2026
·
Hair, Isaac M.
, Li, George Z.
, et al.
·
arXiv (Cornell University)
·
5
PDF
Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy 𝑘-LIN over Expanders
2025
·
Riddhi Ghosal
, Isaac M. Hair
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
4
Convex Polygon Containment: Improving Quadratic to Near Linear Time
2024
·
Chan, Timothy M.
, Hair, Isaac M.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
SVP$_p$ is Deterministically NP-Hard for all $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} n}$
2025
·
Hair, Isaac M.
, Sahai, Amit
·
arXiv (Cornell University)
·
2
PDF
Shaving Two Logs for Discrete and Continuous Fréchet Distance
2026
·
Chan, Timothy M
, Hair, Isaac M
·
arXiv (Cornell University)
·
1
PDF
Polynomial-Factor Deterministic NP-Hardness for SVP in Every $\ell_p$ Norm with $p>2$
2026
·
Hair, Isaac M
, Sahai, Amit
·
arXiv (Cornell University)
·
1
PDF
List Recovery for Random Low-Rate Linear Codes
2026
·
Hair, Isaac M
, Sahai, Amit
·
arXiv (Cornell University)
·
1
PDF
The Case For Data Centre Hyperloops
2024
·
Guillem López-Paradís
, Isaac M. Hair
, et al.
·
Proceedings - International Symposium on Computer Architecture/Proceedings
·
1
PDF
Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy $k$-$\mathsf{LIN}$ Over Expanders
2026
·
Ghosal, Riddhi
, Hair, Isaac M
, et al.
·
arXiv (Cornell University)
PDF
Witness Encryption via Prime-Order Generic Groups
2026
·
Hair, Isaac M
, Sahai, Amit
·
arXiv (Cornell University)
PDF
Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths
2026
·
Hair, Isaac M.
, Li, George Z.
, et al.
·
arXiv (Cornell University)
PDF
Expanding Codes with Polynomial Stretch
2026
·
Hair, Isaac M
, Sahai, Amit
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
15
Citation count:
35
H-index:
4
I10-index:
Year
Topic
Type