default search action
Neekon Vafa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Elette Boyle
, Ilan Komargodski
Memory Checking Requires Logarithmic Overhead. STOC 2024: 1712-1723 - [c6]Seyoon Ragavan, Neekon Vafa
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants. TCC (4) 2024: 3-36 - [c5]Aparna Gupte, Neekon Vafa
Sparse Linear Regression and Lattice Problems. TCC (2) 2024: 276-307 - [i9]Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan:
Sparse Linear Regression and Lattice Problems. CoRR abs/2402.14645 (2024) - [i8]Elette Boyle, Ilan Komargodski, Neekon Vafa:
Memory Checking Requires Logarithmic Overhead. Electron. Colloquium Comput. Complex. TR24 (2024) - [i7]Elette Boyle, Ilan Komargodski, Neekon Vafa:
Memory Checking Requires Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2024: 123 (2024) - [i6]Seyoon Ragavan, Neekon Vafa, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants. IACR Cryptol. ePrint Arch. 2024: 856 (2024) - 2023
- [c4]Surya Mathialagan, Neekon Vafa
MacORAMa: Optimal Oblivious RAM with Integrity. CRYPTO (4) 2023: 95-127 - [i5]Surya Mathialagan, Neekon Vafa:
MacORAMa: Optimal Oblivious RAM with Integrity. IACR Cryptol. ePrint Arch. 2023: 83 (2023) - 2022
- [c3]Aparna Gupte, Neekon Vafa
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. FOCS 2022: 1162-1173 - [c2]Lijie Chen, Shuichi Hirahara, Neekon Vafa
Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions. ITCS 2022: 45:1-45:16 - [i4]Aparna Gupte, Neekon Vafa
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. CoRR abs/2204.02550 (2022) - [i3]Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan:
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. IACR Cryptol. ePrint Arch. 2022: 437 (2022) - 2021
- [j1]Eric Allender
The Non-hardness of Approximating Circuit Size. Theory Comput. Syst. 65(3): 559-578 (2021) - [i2]Lijie Chen, Shuichi Hirahara, Neekon Vafa:
Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions. Electron. Colloquium Comput. Complex. TR21 (2021)
2010 – 2019
- 2019
- [c1]Eric Allender
The Non-hardness of Approximating Circuit Size. CSR 2019: 13-24 - 2018
- [i1]Eric Allender, Rahul Ilango, Neekon Vafa:
The Non-Hardness of Approximating Circuit Size. Electron. Colloquium Comput. Complex. TR18 (2018)
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 2024-12-23 19:32 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by: