☰

Salil P. Vadhan - Publications

Affiliations: 
Computer Science Harvard University, Cambridge, MA, United States 
Tree Info Similar researchers PubMed Report error

35 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Ullman J, Vadhan S. PCPs and the Hardness of Generating Synthetic Data Journal of Cryptology. 1-35. DOI: 10.1007/S00145-020-09363-Y  0.716
2018 Chen Y, Göös M, Vadhan SP, Zhang J. A tight lower bound for entropy flattening Electronic Colloquium On Computational Complexity. 25: 28. DOI: 10.4230/Lipics.Ccc.2018.23  0.366
2018 Bun M, Ullman J, Vadhan SP. Fingerprinting Codes and the Price of Approximate Differential Privacy Siam Journal On Computing. 47: 1888-1938. DOI: 10.1137/15M1033587  0.614
2017 Steinke T, Vadhan SP, Wan A. Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs Theory of Computing. 13: 1-50. DOI: 10.4086/Toc.2017.V013A012  0.699
2013 Chung K, Mitzenmacher M, Vadhan SP. Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream Theory of Computing. 9: 897-945. DOI: 10.4086/Toc.2013.V009A030  0.698
2013 Haitner I, Reingold O, Vadhan S. Efficiency improvements in constructing pseudorandom generators from one-way functions Siam Journal On Computing. 42: 1405-1430. DOI: 10.1137/100814421  0.345
2013 Reingold O, Steinke T, Vadhan S. Pseudorandomness for regular branching programs via Fourier analysis Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8096: 655-670. DOI: 10.1007/978-3-642-40328-6_45  0.32
2013 Reshef YA, Vadhan SP. On extractors and exposure‐resilient functions for sublogarithmic entropy Random Structures and Algorithms. 42: 386-401. DOI: 10.1002/Rsa.20424  0.324
2012 Schoenebeck GR, Vadhan S. The computational complexity of nash equilibria in concisely represented games Acm Transactions On Computation Theory. 4. DOI: 10.1145/2189778.2189779  0.313
2012 Goldreich O, Vadhan S. Special issue from RANDOM’09: Editors’ Foreword Computational Complexity. 21: 1-1. DOI: 10.1007/S00037-011-0035-Z  0.318
2011 Chung KM, Reingold O, Vadhan S. S-T connectivity on digraphs with a known stationary distribution Acm Transactions On Algorithms. 7. DOI: 10.1145/1978782.1978785  0.709
2011 Kamp J, Rao A, Vadhan S, Zuckerman D. Deterministic extractors for small-space sources Journal of Computer and System Sciences. 77: 191-220. DOI: 10.1016/J.Jcss.2010.06.014  0.322
2010 Guruswami V, Vadhan S. A lower bound on list size for list decoding Ieee Transactions On Information Theory. 56: 5681-5688. DOI: 10.1109/Tit.2010.2070170  0.328
2009 Guruswami V, Umans C, Vadhan S. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes Journal of the Acm. 56. DOI: 10.1145/1538902.1538904  0.34
2009 Haitner I, Nguyen M, Ong SJ, Reingold O, Vadhan S. Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function Siam Journal On Computing. 39: 1153-1218. DOI: 10.1137/080725404  0.478
2009 Lovett S, Reingold O, Trevisan L, Vadhan S. Pseudorandom bit generators that fool modular sums Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5687: 615-630. DOI: 10.1007/978-3-642-03685-9_46  0.334
2008 Sanghvi S, Vadhan S. The Round Complexity of Two-Party Random Selection Siam Journal On Computing. 38: 523-550. DOI: 10.1137/050641715  0.373
2008 Nguyen MH, Vadhan S. Simpler session-key generation from short random passwords Journal of Cryptology. 21: 52-96. DOI: 10.1007/S00145-007-9008-4  0.453
2007 Vadhan S. The unified theory of pseudorandomness: guest column Sigact News. 38: 39-54. DOI: 10.1145/1324215.1324225  0.324
2007 Barak B, Ong SJ, Vadhan S. Derandomization in Cryptography Siam Journal On Computing. 37: 380-400. DOI: 10.1137/050641958  0.682
2007 Ron D, Rosenfeld A, Vadhan S. The hardness of the Expected Decision Depth problem Information Processing Letters. 101: 112-118. DOI: 10.1016/J.Ipl.2006.08.012  0.303
2007 Trevisan L, Vadhan S. Pseudorandomness and average-case complexity via uniform reductions Computational Complexity. 16: 331-364. DOI: 10.1007/S00037-007-0233-X  0.305
2007 Goldreich O, Vadhan S. Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword Computational Complexity. 16: 325-330. DOI: 10.1007/S00037-007-0232-Y  0.303
2006 Healy A, Vadhan S, Viola E. Using Nondeterminism to Amplify Hardness Siam Journal On Computing. 35: 903-931. DOI: 10.1137/S0097539705447281  0.659
2006 Vadhan SP. An Unconditional Study of Computational Zero Knowledge Siam Journal On Computing. 36: 1160-1214. DOI: 10.1137/S0097539705447207  0.356
2006 Ben-Sasson ELI, Goldreich O, Harsha P, Sudan M, Vadhan S. Robust PCPs of proximity, shorter PCPs, and applications to coding Siam Journal On Computing. 36: 889-974. DOI: 10.1137/S0097539705446810  0.396
2006 Barak B, Lindell Y, Vadhan S. Lower bounds for non-black-box zero knowledge Journal of Computer and System Sciences. 72: 321-391. DOI: 10.1016/J.Jcss.2005.06.010  0.331
2005 Trevisan L, Vadhan S, Zuckerman D. Compression of samplable sources Computational Complexity. 14: 186-227. DOI: 10.1007/S00037-005-0198-6  0.309
2004 Vadhan SP. Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model Journal of Cryptology. 17: 43-77. DOI: 10.1007/S00145-003-0237-X  0.34
2003 Sahai A, Vadhan S. A complete problem for statistical zero knowledge Journal of the Acm. 50: 196-249. DOI: 10.1145/636865.636868  0.562
2003 Dedic N, Reyzin L, Vadhan SP. An Improved Pseudorandom Generator Based on Hardness of Factoring Lecture Notes in Computer Science. 88-101. DOI: 10.1007/3-540-36413-7  0.318
2002 Reingold O, Vadhan S, Wigderson A. Entropy waves, the zig-zag graph product, and new constant-degree expanders Annals of Mathematics. 155: 157-187. DOI: 10.2307/3062153  0.305
2002 Vadhan SP. The Complexity of Counting in Sparse, Regular, and Planar Graphs Siam Journal On Computing. 31: 398-427. DOI: 10.1137/S0097539797321602  0.343
2002 Bender MA, Fernández A, Ron D, Sahai A, Vadhan S. The Power of a Pebble: Exploring and Mapping Directed Graphs Information and Computation. 176: 1-21. DOI: 10.1006/Inco.2001.3081  0.532
2001 Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S, Yang K. On the (Im)possibility of obfuscating programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2139: 1-18. DOI: 10.1145/2160158.2160159  0.545
Show low-probability matches.