Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Vadhan, Salil"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficiency improvements in constructing pseudorandom generators from one-way functions
Iftach Haitner
,
Omer Reingold
,
Salil Vadhan
SIAM Journal on Computing
42
(3), 2013, pp. 1405-1430
Interactive proofs of proximity: Delegating computation in sublinear time
Guy N. Rothblum
,
Salil Vadhan
,
Avi Wigderson
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 793-802
On the (im)possibility of obfuscating programs
Boaz Barak
,
Oded Goldreich
,
Russell Impagliazzo
,
Steven Rudich
,
Amit Sahai
,
Salil Vadhan
,
Ke Yang
Journal of the ACM
59
(2), 2012, pp. 6: 1-48
Faster algorithms for privately releasing marginals
Justin Thaler
,
Jonathan Ullman
,
Salil Vadhan
Lecture Notes in Computer Science
7391
, 2012, pp. 810-821
Characterizing pseudoentropy and simplifying pseudorandom generator constructions
Salil Vadhan
,
Colin Jia Zheng
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 817-836
Deterministic extractors for small-space sources
Jesse Kamp
,
Anup Rao
,
Salil Vadhan
,
David Zuckerman
Journal of Computer and System Sciences
77
(1), 2011, pp. 191-220
Efficiency improvements in constructing pseudorandom generators from one-way functions
Iftach Haitner
,
Omer Reingold
,
Salil Vadhan
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 437-446
On the complexity of differentially private data release: Efficient algorithms and hardness results
Cynthia Dwork
,
Moni Naor
,
Omer Reingold
,
Guy N. Rothblum
,
Salil Vadhan
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 381-390
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Venkatesan Guruswami
,
Christopher Umans
,
Salil Vadhan
Journal of the ACM
56
(4), 2009, pp. 20: 1-34
Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
Iftach Haitner
,
Minh-Huyen Nguyen
,
Shien Jin Ong
,
Omer Reingold
,
Salil Vadhan
SIAM Journal on Computing
39
(3), 2009, pp. 1153-1218
Inaccessible entropy
Iftach Haitner
,
Omer Reingold
,
Salil Vadhan
,
Hoeteck Wee
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 611-620
The round complexity of two-party random selection
Saurabh Sanghvi
,
Salil Vadhan
SIAM Journal on Computing
38
(2), 2008, pp. 523-550
Derandomization in cryptography
Boaz Barak
,
Shien Jin Ong
,
Salil Vadhan
SIAM Journal on Computing
37
(2), 2007, pp. 380-400
The hardness of the Expected Decision Depth problem
Dana Ron
,
Amir Rosenfeld
,
Salil Vadhan
Information Processing Letters
101
(3), 2007, pp. 112-118
The complexity of zero knowledge
Salil Vadhan
Lecture Notes in Computer Science
4855
, 2007, pp. 52-70
Lower bounds for non-black-box zero knowledge
Boaz Barak
,
Yehuda Lindell
,
Salil Vadhan
Journal of Computer and System Sciences
72
(2), 2006, pp. 321-391
Robust PCPs of proximity, shorter PCPs, and applications to coding
Eli Ben-Sasson
,
Oded Goldreich
,
Prahladh Harsha
,
Madhu Sudan
,
Salil Vadhan
SIAM Journal on Computing
36
(4), 2006, pp. 889-974
Using nondeterminism to amplify hardness
Alexander Healy
,
Salil Vadhan
,
Emanuele Viola
SIAM Journal on Computing
35
(4), 2006, pp. 903-931
Deterministic extractors for small-space sources
Jesse Kamp
,
Anup Rao
,
Salil Vadhan
,
David Zuckerman
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 691-700
Zero knowledge with efficient provers
Minh-Huyen Nguyen
,
Salil Vadhan
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 287-295
Pseudorandom walks on regular digraphs and the RL vs. L problem
Omer Reingold
,
Luca Trevisan
,
Salil Vadhan
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 457-466
An unconditional study of computational zero knowledge
Salil P. Vadhan
SIAM Journal on Computing
36
(4), 2006, pp. 1160-1214
The round complexity of two-party random selection
Saurabh Sanghvi
,
Salil Vadhan
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 338-347
Robust PCPs of proximity, shorter PCPs and applications to coding
Eli Ben-Sasson
,
Oded Goldreich
,
Prahladh Harsha
,
Madhu Sudan
,
Salil Vadhan
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 1-10
Using nondeterminism to amplify hardness
Alexander Healy
,
Salil Vadhan
,
Emanuele Viola
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 192-201
Seiten 1
2
>