Salil Vadhan - Docslib

Sign Up
Log In
Upload

Sign Up
Log In
Upload

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

© 2024 Docslib.org Feedback