Guggenheim Fellowship

Bibliographic References tagged with Guggenheim Fellowship

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Guruswami, Venkatesan, Christopher Umans, and Salil Vadhan. “Unbalanced Expanders and Randomness Extractors from Parvaresh–Vardy Codes”. Journal of the ACM 56, no. 4 (2009): 1–34.
Guruswami, Venkatesan, Christopher Umans, and Salil Vadhan. “Unbalanced Expanders and Randomness Extractors from Parvaresh–Vardy Codes”. Journal of the ACM 56, no. 4 (2009): 1–34.
Chung, Kai-Min, Michael Mitzenmacher, and Salil P. Vadhan. “Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream”. Theory of Computing 9 (2013): 897-945.
Chung, Kai-Min, Michael Mitzenmacher, and Salil P. Vadhan. “Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream”. Theory of Computing 9 (2013): 897-945.
Chailloux, André, Dragos Florin Ciocan, Iordanis Kerenidis, and Salil Vadhan. “Interactive and Noninteractive Zero Knowledge Are Equivalent in the Help Model”. In Proceedings of the Third Theory of Cryptography Conference (TCC ’08), 4948:501-534. Springer-Verlag, Lecture Notes in Computer Science, 2008.
Chailloux, André, Dragos Florin Ciocan, Iordanis Kerenidis, and Salil Vadhan. “Interactive and Noninteractive Zero Knowledge Are Equivalent in the Help Model”. In Proceedings of the Third Theory of Cryptography Conference (TCC ’08), 4948:501-534. Springer-Verlag, Lecture Notes in Computer Science, 2008.
Ong, Shien Jin, and Salil Vadhan. “An Equivalence Between Zero Knowledge and Commitments.”. In R. Canetti, Editor, Proceedings of the Third Theory of Cryptography Conference (TCC ‘08), 4948:482-500. Springer Verlag, Lecture Notes in Computer Science, 2008.
Ong, Shien Jin, and Salil Vadhan. “An Equivalence Between Zero Knowledge and Commitments.”. In R. Canetti, Editor, Proceedings of the Third Theory of Cryptography Conference (TCC ‘08), 4948:482-500. Springer Verlag, Lecture Notes in Computer Science, 2008.
Gutfreund, Dan, and Salil Vadhan. “Limitations on Hardness Vs. Randomness under Uniform Reductions”. In Proceedings of the 12th International Workshop on Randomization and Computation (RANDOM ‘08), Lecture Notes in Computer Science, 5171:469-82. Springer-Verlag, 2008.
Gutfreund, Dan, and Salil Vadhan. “Limitations on Hardness Vs. Randomness under Uniform Reductions”. In Proceedings of the 12th International Workshop on Randomization and Computation (RANDOM ‘08), Lecture Notes in Computer Science, 5171:469-82. Springer-Verlag, 2008.
Reingold, Omer, Luca Trevisan, Madhur Tulsiani, and Salil Vadhan. “Dense Subsets of Pseudorandom Sets”. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘08), 76-85. IEEE, 2008.
Reingold, Omer, Luca Trevisan, Madhur Tulsiani, and Salil Vadhan. “Dense Subsets of Pseudorandom Sets”. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘08), 76-85. IEEE, 2008.
Haitner, Iftach, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy”. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC ‘09), 611-20. ACM, 2009.
Haitner, Iftach, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy”. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC ‘09), 611-20. ACM, 2009.