Publications

Sort & Filters

Filters

Publication Taxonomies
Publication Grants
Year of Publication

149 results

149 results

2026

Vadhan, Salil, and Jiyu Zhang. “Finding Nearly-Periodic Components in Digraphs and Markov Chains from the Spectrum of Rotated Laplacian Matrices.”
Vadhan, Salil, and Jiyu Zhang. “Finding Nearly-Periodic Components in Digraphs and Markov Chains from the Spectrum of Rotated Laplacian Matrices.”
Pyne, Edward, and Salil Vadhan. “Pseudodistributions That Beat All Pseudorandom Generators”. Theory of Computing 22, CCC 2021 Special Issue, no. 3 (2026): 1-63.
Pyne, Edward, and Salil Vadhan. “Pseudodistributions That Beat All Pseudorandom Generators”. Theory of Computing 22, CCC 2021 Special Issue, no. 3 (2026): 1-63.
Henzinger, Monika, Roodabeh Safavi, and Salil Vadhan. “Concurrent Composition for Differentially Private Continual Mechanisms”. In Proceedings of the ACM on Management of Data (PODS ’26) 4, 2. Article 99, 26 pages, May, 2026. https://doi.org/10.1145/3801895.
Henzinger, Monika, Roodabeh Safavi, and Salil Vadhan. “Concurrent Composition for Differentially Private Continual Mechanisms”. In Proceedings of the ACM on Management of Data (PODS ’26) 4, 2. Article 99, 26 pages, May, 2026. https://doi.org/10.1145/3801895.
Fish, Sara, Yannai A. Gonczarowski, Jason Z. Tang, and Salil Vadhan. “Tradeoffs in Privacy, Welfare, and Fairness for Facility Location”. In Lin, Huijia (Rachel), Ed., Proceedings of the 7th Symposium on Foundations of Responsible Computing (FORC ’26). Leibniz International Proceedings in Informatics (LIPIcs), volume 366, June, 2026.
Fish, Sara, Yannai A. Gonczarowski, Jason Z. Tang, and Salil Vadhan. “Tradeoffs in Privacy, Welfare, and Fairness for Facility Location”. In Lin, Huijia (Rachel), Ed., Proceedings of the 7th Symposium on Foundations of Responsible Computing (FORC ’26). Leibniz International Proceedings in Informatics (LIPIcs), volume 366, June, 2026.
Putterman, Aaron, Salil Vadhan, and Vadim Zaripov. “Bounded-Independence Sampling of Edges for Combinatorial Graph Properties”. In Proceedings of The 41st Computational Complexity Conference (CCC ’26). Leibniz International Proceedings in Informatics (LIPIcs), Volume 383, July, 2026.
Putterman, Aaron, Salil Vadhan, and Vadim Zaripov. “Bounded-Independence Sampling of Edges for Combinatorial Graph Properties”. In Proceedings of The 41st Computational Complexity Conference (CCC ’26). Leibniz International Proceedings in Informatics (LIPIcs), Volume 383, July, 2026.

2025

Ratliff, Zachary, and Salil Vadhan. “Securing Unbounded Differential Privacy Against Timing Attacks”. Lecture Notes in Computer Science 16271, no. Proceedings of the 23rd Theory of Cryptography Conference (TCC ‘25) (2025): 30.
Ratliff, Zachary, and Salil Vadhan. “Securing Unbounded Differential Privacy Against Timing Attacks”. Lecture Notes in Computer Science 16271, no. Proceedings of the 23rd Theory of Cryptography Conference (TCC ‘25) (2025): 30.
Nanayakkara, Priyanka, Elena Ghazi, and Salil Vadhan. “Practitioners’ Perspectives on a Differential Privacy Deployment Registry.”
Nanayakkara, Priyanka, Elena Ghazi, and Salil Vadhan. “Practitioners’ Perspectives on a Differential Privacy Deployment Registry.”
Ruotolo, Jake, and Salil Vadhan. “Singular Values versus Expansion in Directed and Undirected Graphs.”
Ruotolo, Jake, and Salil Vadhan. “Singular Values versus Expansion in Directed and Undirected Graphs.”
Canonne, Clément L., Francis E. Su, and Salil P. Vadhan. “The Randomness Complexity of Differential Privacy”. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Columbia University, New York, New York, United States: Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 27:1-27:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.27.
Canonne, Clément L., Francis E. Su, and Salil P. Vadhan. “The Randomness Complexity of Differential Privacy”. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Columbia University, New York, New York, United States: Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 27:1-27:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.27.
Clementi, Andrea, Venkatesan Guruswami, Kristin Kane, Alon Rosen, Nikhil Srivastava, Salil Vadhan, and Riccardo Zecchina. “Obituary for Luca Trevisan”. Bulletin of European Association for Theoretical Computer Science, 2025.
Clementi, Andrea, Venkatesan Guruswami, Kristin Kane, Alon Rosen, Nikhil Srivastava, Salil Vadhan, and Riccardo Zecchina. “Obituary for Luca Trevisan”. Bulletin of European Association for Theoretical Computer Science, 2025.
Gaboardi, Marco, Michael Hay, and Salil Vadhan. “Programming Frameworks for Differential Privacy”. In Differential Privacy in Artificial Intelligence: From Theory to Practice, edited by Ferdinando Fioretto and Pascal Van Hentenryck, 407-39. Boston, Massachusetts: NOW Publishers, 2025.
Gaboardi, Marco, Michael Hay, and Salil Vadhan. “Programming Frameworks for Differential Privacy”. In Differential Privacy in Artificial Intelligence: From Theory to Practice, edited by Ferdinando Fioretto and Pascal Van Hentenryck, 407-39. Boston, Massachusetts: NOW Publishers, 2025.
Marcussen, Cassandra, Aaron Putterman, and Salil P. Vadhan. “Characterizing the Distinguishability of Product Distributions through Multicalibration”. In 40th Computational Complexity Conference (CCC ’25). Toronto, Canada: Srikanth Srinivasan, ed., Proceedings of the 40th Computational Complexity Conference (CCC ’25), vol. 330 of LIPIcs, pages 19:1-19:19. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.CCC.2025.19.
Marcussen, Cassandra, Aaron Putterman, and Salil P. Vadhan. “Characterizing the Distinguishability of Product Distributions through Multicalibration”. In 40th Computational Complexity Conference (CCC ’25). Toronto, Canada: Srikanth Srinivasan, ed., Proceedings of the 40th Computational Complexity Conference (CCC ’25), vol. 330 of LIPIcs, pages 19:1-19:19. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.CCC.2025.19.