default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsaac M. Hair
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c5]Isaac M. Hair
, Amit Sahai:
SVPp Is Deterministically NP-Hard for All p > 2, Even to Approximate within a Factor of 2log1-εn. STOC 2026: 1716-1727- [i9]Isaac M. Hair, Amit Sahai:
Deterministic Hardness of Approximation For SVP in all Finite ℓp Norms. CoRR abs/2604.01451 (2026) - [i8]Isaac M. Hair, Amit Sahai:
Public Key Encryption from High-Corruption Constraint Satisfaction Problems. CoRR abs/2604.10479 (2026) - [i7]Isaac M. Hair, Amit Sahai:
List Recovery for Random Low-Rate Linear Codes. CoRR abs/2605.30101 (2026) - 2025
- [c4]Timothy M. Chan, Isaac M. Hair:
A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation. SoCG 2025: 31:1-31:16 - [c3]Riddhi Ghosal, Isaac M. Hair, Aayush Jain, Amit Sahai:
Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy k-LIN over Expanders. STOC 2025: 1921-1932 - [i6]Timothy M. Chan, Isaac M. Hair:
A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation. CoRR abs/2504.18352 (2025) - [i5]Isaac M. Hair, Amit Sahai:
SVPp is NP-Hard for all p > 2, Even to Approximate Within a Factor of 2{log1-ϵ n. CoRR abs/2511.04125 (2025) - [i4]Isaac M. Hair, Amit Sahai:
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. TR25: Article TR25-153 (2025) - [i3]Riddhi Ghosal, Isaac M. Hair, Aayush Jain, Amit Sahai:
Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy k-LIN Over Expanders. IACR Cryptol. ePrint Arch. 2025: 1501 (2025) - [i2]Isaac M. Hair, Amit Sahai:
SVPp is Deterministically NP-Hard for all p > 2, Even to Approximate Within a Factor of 2log1-ε n. IACR Cryptol. ePrint Arch. 2025: 2181 (2025) - 2024
- [c2]Timothy M. Chan, Isaac M. Hair:
Convex Polygon Containment: Improving Quadratic to Near Linear Time. SoCG 2024: 34:1-34:15 - [c1]Guillem López-Paradís, Isaac M. Hair, Sid Kannan, Roman Rabbat, Parker Murray, Alex Lopes, Rory Zahedi, Winston Zuo, Jonathan Balkind:
The Case For Data Centre Hyperloops. ISCA 2024: 230-244 - [i1]Timothy M. Chan, Isaac M. Hair:
Convex Polygon Containment: Improving Quadratic to Near Linear Time. CoRR abs/2403.13292 (2024)
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 2026-06-27 04: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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
