Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(104)
Omer Reingold
30
Oded Goldreich
19
Luca Trevisan
18
Amit Sahai
16
Avi Wigderson
15
Conferences
(14)
STOC
17
Theory of Cryptography
10
CRYPTO
9
FOCS
9
CCC
6
Journals
(11)
ECCC
28
SIAMCOMP
7
CC
5
JCSS
3
JACM
2
Keywords
(169)
Embed
Subscribe
Academic
Authors
Salil P. Vadhan
Edit
Salil P. Vadhan
Harvard University
Publications: 148
|
Citations: 3235
|
G-Index: 52
|
H-Index: 32
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Algorithms & Theory
,
Scientific Computing
,
Security & Privacy
View FAQ about top research area and research interests
Collaborated with
104 co-authors
from 1995 to 2011
; Cited by
1712 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(148)
BibTeX
|
RIS
|
RefWorks
Download
Deterministic extractors for small-space sources
(
Citations: 3
)
Jesse Kamp
,
Anup Rao
,
Salil P. Vadhan
,
David Zuckerman
Journal:
Journal of Computer and System Sciences - JCSS
, vol. 77, no. 1, pp. 191-220, 2011
On the complexity of computational problems regarding distributions (a survey)
Oded Goldreich
,
Salil P. Vadhan
Journal:
Electronic Colloquium on Computational Complexity - ECCC
, vol. 18, 2011
PCPs and the Hardness of Generating Private Synthetic Data
Jonathan Ullman
,
Salil P. Vadhan
Conference:
Theory of Cryptography
, pp. 400-416, 2011
Boosting and Differential Privacy
(
Citations: 4
)
Cynthia Dwork
,
Guy N. Rothblum
,
Salil P. Vadhan
Conference:
IEEE Symposium on Foundations of Computer Science - FOCS
, pp. 51-60, 2010
Efficiency improvements in constructing pseudorandom generators from one-way functions
(
Citations: 4
)
Iftach Haitner
,
Omer Reingold
,
Salil P. Vadhan
Conference:
ACM Symposium on Theory of Computing - STOC
, vol. 17, pp. 437-446, 2010
Order by:
Citations
(3235 times by 1902 publications)
A firm foundation for private data analysis
(
Citations: 16
)
Cynthia Dwork
Journal:
Communications of The ACM - CACM
, vol. 54, no. 1, pp. 86-95, 2011
Possibility and Impossibility Results for Selective Decommitments
(
Citations: 5
)
Dennis Hofheinz
Journal:
Journal of Cryptology - JOC
, vol. 24, no. 3, pp. 470-516, 2011
(If) Size Matters: Size-Hiding Private Set Intersection
(
Citations: 3
)
Giuseppe Ateniese
,
Emiliano De Cristofaro
,
Gene Tsudik
Conference:
Public Key Cryptography - PKC
, pp. 156-173, 2011
On the optimal approximation of queries using tractable propositional languages
(
Citations: 2
)
Robert Fink
,
Dan Olteanu
Conference:
International Conference on Database Theory - ICDT
, pp. 174-185, 2011
Deterministic extractors for small-space sources
(
Citations: 3
)
Jesse Kamp
,
Anup Rao
,
Salil P. Vadhan
,
David Zuckerman
Journal:
Journal of Computer and System Sciences - JCSS
, vol. 77, no. 1, pp. 191-220, 2011
Comments