Articles by Salil Vadhan
|
Vol 17, Article 4 (pp 1-35)
[APRX-RND19 Spec Issue]
Deterministic Approximation of Random Walks in Small Space by Jack Murtagh, Omer Reingold, Aaron Sidford, and Salil Vadhan |
|
Vol 16, Article 8 (pp 1-55)
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing by Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee |
|
Vol 14, Article 8 (pp 1-35)
The Complexity of Computing the Optimal Composition of Differential Privacy by Jack Murtagh and Salil Vadhan |
|
Vol 13, Article 12 (pp 1-50)
[APRX-RND14 Spec Issue]
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs by Thomas Steinke, Salil Vadhan, and Andrew Wan |
|
Vol 9, Article 30 (pp 897-945)
Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream by Kai-Min Chung, Michael Mitzenmacher, and Salil Vadhan |