Sloan Fellowship

Bibliographic References tagged with Sloan Fellowship

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Henzinger, Monika, Roodabeh Safavi, and Salil P. Vadhan. “Concurrent Composition for Differentially Private Continual Mechanisms.”
Henzinger, Monika, Roodabeh Safavi, and Salil P. Vadhan. “Concurrent Composition for Differentially Private Continual Mechanisms.”
Vadhan, Salil, and Tianhao Wang. “Concurrent Composition of Differential Privacy”. 19th Theory of Cryptography Conference (TCC ’21) . Lecture Notes in Computer Science (Springer), 2021.
Vadhan, Salil, and Tianhao Wang. “Concurrent Composition of Differential Privacy”. 19th Theory of Cryptography Conference (TCC ’21) . Lecture Notes in Computer Science (Springer), 2021.
Ben-Sasson, Eli, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. “Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding”. SIAM Journal on Computing: Special Issue on Randomness and Complexity 36, no. 4 (2006): 889-974.
Ben-Sasson, Eli, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. “Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding”. SIAM Journal on Computing: Special Issue on Randomness and Complexity 36, no. 4 (2006): 889-974.
Healy, Alex, Salil Vadhan, and Emanuele Viola. “Using Nondeterminism to Amplify Hardness”. SIAM Journal on Computing: Special Issue on STOC ’04 35, no. 4 (2006): 903-31.
Healy, Alex, Salil Vadhan, and Emanuele Viola. “Using Nondeterminism to Amplify Hardness”. SIAM Journal on Computing: Special Issue on STOC ’04 35, no. 4 (2006): 903-31.
Trevisan, Luca, Salil Vadhan, and David Zuckerman. “Compression of Samplable Sources”. Computational Complexity: Special Issue on CCC’04 14, no. 3 (2005): 186-227.
Trevisan, Luca, Salil Vadhan, and David Zuckerman. “Compression of Samplable Sources”. Computational Complexity: Special Issue on CCC’04 14, no. 3 (2005): 186-227.
Vadhan, Salil. “An Unconditional Study of Computational Zero Knowledge”. SIAM Journal on Computing: Special Issue on Randomness and Complexity 36, no. 4 (2006): 1160-1214.
Vadhan, Salil. “An Unconditional Study of Computational Zero Knowledge”. SIAM Journal on Computing: Special Issue on Randomness and Complexity 36, no. 4 (2006): 1160-1214.
Sanghvi, Saurabh, and Salil Vadhan. “The Round Complexity of Two-Party Random Selection”. SIAM Journal on Computing: Special Issue on STOC ’05 38, no. 2 (2008): 523-50.
Sanghvi, Saurabh, and Salil Vadhan. “The Round Complexity of Two-Party Random Selection”. SIAM Journal on Computing: Special Issue on STOC ’05 38, no. 2 (2008): 523-50.
Reingold, Omer, Luca Trevisan, and Salil Vadhan. “Pseudorandom Walks in Regular Digraphs and the RL Vs. L Problem”. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC ‘06), 457-66.
Reingold, Omer, Luca Trevisan, and Salil Vadhan. “Pseudorandom Walks in Regular Digraphs and the RL Vs. L Problem”. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC ‘06), 457-66.
Schoenebeck, Grant, and Salil Vadhan. “The Computational Complexity of Nash Equilibria in Concisely Represented Games”. ACM Transactions on Computation Theory 4, no. 2 (2012).
Schoenebeck, Grant, and Salil Vadhan. “The Computational Complexity of Nash Equilibria in Concisely Represented Games”. ACM Transactions on Computation Theory 4, no. 2 (2012).
Ben-Sasson, Eli, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. “Short PCPs Verifiable in Polylogarithmic Time”. In Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC ’05), 120-34.
Ben-Sasson, Eli, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. “Short PCPs Verifiable in Polylogarithmic Time”. In Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC ’05), 120-34.