US-Israel BSF 2002246

Bibliographic References tagged with US-Israel BSF 2002246

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
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.
Kamp, Jesse, Anup Rao, Salil Vadhan, and David Zuckerman. “Deterministic Extractors for Small-Space Sources”. Journal of Computer and System Sciences 77, no. 1 (2011): 191-220.
Kamp, Jesse, Anup Rao, Salil Vadhan, and David Zuckerman. “Deterministic Extractors for Small-Space Sources”. Journal of Computer and System Sciences 77, no. 1 (2011): 191-220.
Gradwohl, Ronen, Salil Vadhan, and David Zuckerman. “Random Selection With an Adversarial Majority”. In Advances in Cryptology—CRYPTO ‘06, C. Dwork, Ed., 4117:409–426. Springer Verlag, Lecture Notes in Computer Science , 2006.
Gradwohl, Ronen, Salil Vadhan, and David Zuckerman. “Random Selection With an Adversarial Majority”. In Advances in Cryptology—CRYPTO ‘06, C. Dwork, Ed., 4117:409–426. Springer Verlag, Lecture Notes in Computer Science , 2006.
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, Omer Reingold, and Salil Vadhan. “S-T Connectivity on Digraphs With a Known Stationary Distribution”. In ACM Transactions on Algorithms, 3rd ed. Vol. 7. ACM, 2011.
Chung, Kai-Min, Omer Reingold, and Salil Vadhan. “S-T Connectivity on Digraphs With a Known Stationary Distribution”. In ACM Transactions on Algorithms, 3rd ed. Vol. 7. ACM, 2011.
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.
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.
Haitner, Iftach, Minh Nguyen, Shien Jin Ong, Omer Reingold, and Salil Vadhan. “Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function”. SIAM Journal on Computing 39, no. 3 (2009): 1153-1218.
Haitner, Iftach, Minh Nguyen, Shien Jin Ong, Omer Reingold, and Salil Vadhan. “Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function”. SIAM Journal on Computing 39, no. 3 (2009): 1153-1218.
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.