BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
1 × United Kingdom
12 × USA
Collaborated with:
O.Reingold A.Wigderson O.Goldreich M.Sudan J.Ullman L.Trevisan I.Haitner G.N.Rothblum A.Sahai C.J.Zheng M.Nguyen S.Sanghvi D.Lewin E.Ben-Sasson M.Bun J.Thaler A.Healy E.Viola R.Raz H.Wee J.Kamp A.Rao D.Zuckerman C.Lu M.R.Capalbo C.Dwork M.Naor P.Harsha M.A.Bender A.Fernández D.Ron
Talks about:
pseudorandom (4) random (4) effici (4) extractor (3) knowledg (3) interact (3) generat (3) complex (3) prover (3) proof (3)

Person: Salil P. Vadhan

DBLP DBLP: Vadhan:Salil_P=

Facilitated 1 volumes:

STOC 2011Ed

Contributed to:

STOC 20142014
STOC 20132013
ICALP (1) 20122012
STOC 20122012
STOC 20102010
STOC 20092009
STOC 20062006
STOC 20052005
STOC 20042004
STOC 20032003
STOC 20022002
ICALP 20012001
STOC 20002000
STOC 19991999
STOC 19981998

Wrote 23 papers:

STOC-2014-BunUV #approximate #difference #privacy
Fingerprinting codes and the price of approximate differential privacy (MB, JU, SPV), pp. 1–10.
STOC-2013-RothblumVW #interactive #proving #proximity #sublinear
Interactive proofs of proximity: delegating computation in sublinear time (GNR, SPV, AW), pp. 793–802.
ICALP-v1-2012-ThalerUV #algorithm #performance
Faster Algorithms for Privately Releasing Marginals (JT, JU, SPV), pp. 810–821.
STOC-2012-VadhanZ #generative #pseudo
Characterizing pseudoentropy and simplifying pseudorandom generator constructions (SPV, CJZ), pp. 817–836.
STOC-2010-HaitnerRV #generative #performance #pseudo
Efficiency improvements in constructing pseudorandom generators from one-way functions (IH, OR, SPV), pp. 437–446.
STOC-2009-DworkNRRV #algorithm #complexity #on the #performance
On the complexity of differentially private data release: efficient algorithms and hardness results (CD, MN, OR, GNR, SPV), pp. 381–390.
STOC-2009-HaitnerRVW
Inaccessible entropy (IH, OR, SPV, HW), pp. 611–620.
STOC-2006-KampRVZ
Deterministic extractors for small-space sources (JK, AR, SPV, DZ), pp. 691–700.
STOC-2006-NguyenV #performance #proving
Zero knowledge with efficient provers (MHN, SPV), pp. 287–295.
STOC-2006-ReingoldTV #graph #problem #pseudo
Pseudorandom walks on regular digraphs and the RL vs. L problem (OR, LT, SPV), pp. 457–466.
STOC-2005-SanghviV #complexity #random
The round complexity of two-party random selection (SS, SPV), pp. 338–347.
STOC-2004-Ben-SassonGHSV #proximity #robust
Robust pcps of proximity, shorter pcps and applications to coding (EBS, OG, PH, MS, SPV), pp. 1–10.
STOC-2004-HealyVV #nondeterminism #using
Using nondeterminism to amplify hardness (AH, SPV, EV), pp. 192–201.
STOC-2003-Ben-SassonSVW #testing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (EBS, MS, SPV, AW), pp. 612–621.
STOC-2003-LuRVW #constant #named
Extractors: optimal up to constant factors (CJL, OR, SPV, AW), pp. 602–611.
STOC-2002-CapalboRVW
Randomness conductors and constant-degree lossless expanders (MRC, OR, SPV, AW), pp. 659–668.
ICALP-2001-GoldreichVW #interactive #on the #proving
On Interactive Proofs with a Laconic Prover (OG, SPV, AW), pp. 334–345.
STOC-2000-Vadhan #complexity #interactive #on the #proving
On transformation of interactive proofs that preserve the prover’s complexity (SPV), pp. 200–207.
STOC-1999-RazRV #fault
Extracting all the Randomness and Reducing the Error in Trevisan’s Extractors (RR, OR, SPV), pp. 149–158.
STOC-1999-SudanTV #generative #pseudo
Pseudorandom Generators Without the XOR Lemma (MS, LT, SPV), pp. 537–546.
STOC-1998-BenderFRSV #graph #power of
The Power of a Pebble: Exploring and Mapping Directed Graphs (MAB, AF, DR, AS, SPV), pp. 269–278.
STOC-1998-GoldreichSV #statistics
Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge (OG, AS, SPV), pp. 399–408.
STOC-1998-LewinV #polynomial #question #towards
Checking Polynomial Identities over any Field: Towards a Derandomization? (DL, SPV), pp. 438–447.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.