Computational Complexity

Bibliographic References tagged with Computational Complexity

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Doron, Dean, Jack Murtagh, Salil Vadhan, and David Zuckerman. “Small-Space Spectral Sparsification via Bounded-Independence Sampling”. ACM Transactions on Computation Theory 16, no. 2 (2024): 32.
Doron, Dean, Jack Murtagh, Salil Vadhan, and David Zuckerman. “Small-Space Spectral Sparsification via Bounded-Independence Sampling”. ACM Transactions on Computation Theory 16, no. 2 (2024): 32.
Vadhan, Salil. “The Complexity of Differential Privacy”. In Tutorials on the Foundations of Cryptography, 347-450. Springer, Yehuda Lindell, ed., 2017.
Vadhan, Salil. “The Complexity of Differential Privacy”. In Tutorials on the Foundations of Cryptography, 347-450. Springer, Yehuda Lindell, ed., 2017.
Haitner, Iftach, and Salil Vadhan. “The Many Entropies in One-Way Functions”. In Tutorials on the Foundations of Cryptography, 159-217. Springer, Yehuda Lindell, ed., 2017.
Haitner, Iftach, and Salil Vadhan. “The Many Entropies in One-Way Functions”. In Tutorials on the Foundations of Cryptography, 159-217. Springer, Yehuda Lindell, ed., 2017.
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.
Micciancio, Daniele, Shien Jin Ong, Amit Sahai, and Salil Vadhan. “Concurrent Zero Knowledge Without Complexity Assumptions”. In S. Halevi and T. Rabin, Eds., Proceedings of the Third Theory of Cryptography Conference (TCC ’06), 3876:1-20. New York, NY, USA: Springer Verlag, Lecture Notes in Computer Science, 2006.
Micciancio, Daniele, Shien Jin Ong, Amit Sahai, and Salil Vadhan. “Concurrent Zero Knowledge Without Complexity Assumptions”. In S. Halevi and T. Rabin, Eds., Proceedings of the Third Theory of Cryptography Conference (TCC ’06), 3876:1-20. New York, NY, USA: Springer Verlag, Lecture Notes in Computer Science, 2006.
Haitner, Iftach, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions”. ArXiv: 2010.05586 [cs.CR], 2020.
Haitner, Iftach, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions”. ArXiv: 2010.05586 [cs.CR], 2020.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Pseudorandom Generators for Unbounded-Width Permutation Branching Programs”. 12th Innovations in Theoretical Computer Science (ITCS ’21) . Leibniz International Proceedings in Informatics (LIPIcs), 2021.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Pseudorandom Generators for Unbounded-Width Permutation Branching Programs”. 12th Innovations in Theoretical Computer Science (ITCS ’21) . Leibniz International Proceedings in Informatics (LIPIcs), 2021.
Doron, Dean, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan. “Pseudorandom Generators for Read-Once Monotone Branching Programs”. APPROX//RANDOM/2021. Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Doron, Dean, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan. “Pseudorandom Generators for Read-Once Monotone Branching Programs”. APPROX//RANDOM/2021. Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs”. Algorithmica 86:3153-3185, no. Special Issue on COCOON ’21 (2024).
Hoza, William M., Edward Pyne, and Salil Vadhan. “Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs”. Algorithmica 86:3153-3185, no. Special Issue on COCOON ’21 (2024).
Barak, Boaz, Yael Kalai, Ran Raz, Salil Vadhan, and Nisheeth Vishnoi. “On the Works of Avi Widgerson”. In The Abel Prize 2018-2022 (eds. Helge Holden and Ragni Piene), 2023rd ed. Springer, Cham, 2024.
Barak, Boaz, Yael Kalai, Ran Raz, Salil Vadhan, and Nisheeth Vishnoi. “On the Works of Avi Widgerson”. In The Abel Prize 2018-2022 (eds. Helge Holden and Ragni Piene), 2023rd ed. Springer, Cham, 2024.