US-Israel BSF 2010196
Bibliographic References tagged with US-Israel BSF 2010196
Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Vadhan, Salil, and Colin Jia Zheng. “Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions”. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC ‘12), 817-36. ACM, 2012.
Vadhan, Salil, and Colin Jia Zheng. “Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions”. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC ‘12), 817-36. ACM, 2012.
Vadhan, Salil, and Colin Jia Zheng. “A Uniform Min-Max Theorem With Applications in Cryptography”. In Ran Canetti and Juan Garay, Editors, Advances in Cryptology—CRYPTO ‘13, Lecture Notes on Computer Science, 8042:93-110. Springer Verlag, Lecture Notes in Computer Science, 2013.
Vadhan, Salil, and Colin Jia Zheng. “A Uniform Min-Max Theorem With Applications in Cryptography”. In Ran Canetti and Juan Garay, Editors, Advances in Cryptology—CRYPTO ‘13, Lecture Notes on Computer Science, 8042:93-110. Springer Verlag, Lecture Notes in Computer Science, 2013.
Reingold, Omer, Thomas Steinke, and Salil Vadhan. “Pseudorandomness for Regular Branching Programs via Fourier Analysis”. In Sofya Raskhodnikova and José Rolim, Editors, Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM ‘13), Lecture Notes in Computer Science, 8096:655-70. Springer-Verlag, 2013.
Reingold, Omer, Thomas Steinke, and Salil Vadhan. “Pseudorandomness for Regular Branching Programs via Fourier Analysis”. In Sofya Raskhodnikova and José Rolim, Editors, Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM ‘13), Lecture Notes in Computer Science, 8096:655-70. Springer-Verlag, 2013.
Gopalan, Parikshit, Salil Vadhan, and Yuan Zhou. “Locally Testable Codes and Cayley Graphs”. In In Moni Naor, Editor, Innovations in Theoretical Computer Science (ITCS ‘14), 81-92. ACM, 2014.
Gopalan, Parikshit, Salil Vadhan, and Yuan Zhou. “Locally Testable Codes and Cayley Graphs”. In In Moni Naor, Editor, Innovations in Theoretical Computer Science (ITCS ‘14), 81-92. ACM, 2014.
Steinke, Thomas, Salil Vadhan, and Andrew Wan. “Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs”. Theory of Computing – Special Issue on APPROX-RANDOM 2014 13, no. 12 (2017): 1-50.
Steinke, Thomas, Salil Vadhan, and Andrew Wan. “Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs”. Theory of Computing – Special Issue on APPROX-RANDOM 2014 13, no. 12 (2017): 1-50.