DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Salil Vadhan
Salil Vadhan
The Limits of Post-Selection Generalization
The Computational Complexity of Nash Equilibria in Concisely Represented Games∗
Pseudodistributions That Beat All Pseudorandom Generators
Hardness of Non-Interactive Differential Privacy from One-Way
Zero Knowledge and Soundness Are Symmetric∗
Pseudorandomness and Combinatorial Constructions
Computational Complexity
Pseudorandomness for Regular Branching Programs Via Fourier Analysis
A Note on Extracting Randomness from Santha-Vazirani Sources
Verifiable Random Functions
Arxiv:1912.04524V1 [Cs.CC] 10 Dec 2019
A Study of Statistical Zero-Knowledge Proofs Salil Pravin
Unifying Framework and New Methods
Arxiv:2012.06421V2 [Cs.LG] 21 Jul 2021
Deterministic Approximation of Random Walks in Small Space
Differentially Private Release and Learning of Threshold Functions∗
The Complexity of Differential Privacy
SIGACT Viability
Top View
Pseudorandom Generators Without the XOR Lemma
Extractors for Three Uneven-Length Sources
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs
Curriculum Vitae
New England Faculty Summit on Cyber Security Held at Boston University on June 28, 2011
Lipics-ITCS-2018-0.Pdf (0.4
Sloan Privacy Bibliography
On the Power of Many One-Bit Provers
A Study of Efficient Secret Sharing By
ACM-2019-Computational Entropy.Pdf
Derandomized Squaring of Graphs∗
Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract)
The Limits of Two-Party Differential Privacy
Verifiable Random Functions
Pseudorandom Walks on Regular Digraphs and the RL Vs. L Problem∗ PRELIMINARY VERSION
Pdf Full Paper (NBER Wp 25626)
A Biography of Avi Wigderson
Salil P. Vadhan
EUROCRYPT 2007.Pdf
Mathematisches Forschungsinstitut Oberwolfach Complexity Theory
An $ O (N^{\Epsilon}) $ Space and Polynomial Time Algorithm For
Compression of Nonlocal Games
Salil P. Vadhan
Sponsored by IEEE Computer Society Technical Committee On
PSEUDORANDOMNESS and AVERAGE-CASE COMPLEXITY VIA UNIFORM REDUCTIONS Luca Trevisan and Salil Vadhan
Arxiv:2005.00010V1 [Stat.ML] 30 Apr 2020
Undirected Laplacian Systems in Nearly Logarithmic Space
Salil P. Vadhan
High-Precision Estimation of Random Walks in Small Space
Mathematics and Computation
Visions for Theoretical Computer Science
On Expander Graphs and Connectivity in Small Space
Deterministic Approximation of Random Walks in Small Space
2009 Karl Menger Award
1 Introduction
Bounded Independence Versus Symmetric Tests∗
Arxiv:1210.0049V1 [Cs.CC] 28 Sep 2012 Eerhslcnvalley
Zero Knowledge and Soundness Are Symmetric∗
Arxiv:1610.06918V1 [Cs.CR] 21 Oct 2016
Differential Privacy with Imperfect Randomness
Truthful Mechanisms for Agents That Value Privacy
Computational Complexity Conference
Deterministic Approximation of Random Walks in Small Space
Lipics-ITCS-2021-0.Pdf (0.3
John Von Neumann
Salil P. Vadhan
A Complete Problem for Statistical Zero Knowledge
A Unified Theory of Pseudorandomness
Undirected Connectivity in Log-Space∗
The Complexity of Zero Knowledge
Pseudorandom Generators for Read-Once Monotone Branching Programs
Differentially Private Release and Learning of Threshold Functions