Neekon Vafa

According to our database, Neekon Vafa authored at least 6 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Memory Checking Requires Logarithmic Overhead.

Elette Boyle, Ilan Komargodski, Neekon Vafa

Electron. Colloquium Comput. Complex., 2024

Sparse Linear Regression and Lattice Problems.

Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan

CoRR, 2024

2023

MacORAMa: Optimal Oblivious RAM with Integrity.

Surya Mathialagan, Neekon Vafa

IACR Cryptol. ePrint Arch., 2023

2022

Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures.

Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan

IACR Cryptol. ePrint Arch., 2022

2021

Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions.

Lijie Chen, Shuichi Hirahara, Neekon Vafa

Electron. Colloquium Comput. Complex., 2021

2018

The Non-Hardness of Approximating Circuit Size.

Eric Allender, Rahul Ilango, Neekon Vafa

Electron. Colloquium Comput. Complex., 2018