Publications

Sort & Filters

Filters

Publication Taxonomies
Publication Grants
Year of Publication

145 results

145 results

2026

Putterman, Aaron, Salil Vadhan, and Vadim Zaripov. “Bounded Independence Edge Sampling for Combinatorial Graph Properties.”
Putterman, Aaron, Salil Vadhan, and Vadim Zaripov. “Bounded Independence Edge Sampling for Combinatorial Graph Properties.”

2025

Ratliff, Zachary, and Salil Vadhan. “Securing Unbounded Differential Privacy Against Timing Attacks”. In Theory of Cryptography Conference (TCC 2025). 2025. Reprint, Aarhus, Denmark: In: Applebaum, Benny, and Huijia (Rachel) Lin, eds., Proceedings of the 23rd Theory of Cryptography Conference (TCC ’25) vol. 16251 of Lecture Notes in Computer Science, pages 378–414. IACR, Springer, December 2025, 2025.
Ratliff, Zachary, and Salil Vadhan. “Securing Unbounded Differential Privacy Against Timing Attacks”. In Theory of Cryptography Conference (TCC 2025). 2025. Reprint, Aarhus, Denmark: In: Applebaum, Benny, and Huijia (Rachel) Lin, eds., Proceedings of the 23rd Theory of Cryptography Conference (TCC ’25) vol. 16251 of Lecture Notes in Computer Science, pages 378–414. IACR, Springer, December 2025, 2025.
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.
D’Orsi, Tommaso, Chris Jones, Jake Ruotolo, Salil Vadhan, and Jiyu Zhang. “Sparsest Cut and Eigenvalue Multiplicities on Low Degree Abelian Cayley Graphs”. In 28th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX ’25). in volume 353 of Leibniz International Proceedings in Informatics (LIPIcs) pages 16:1-16:20, Dagstuhl, Germany, 2025. Schloss Dagstuhl-Leibniz-Zentrum für Informatik: Alina Ene and Eshan Chattopadhyay, eds., Proceedings of the 28th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX ’25), 2025. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.16.
D’Orsi, Tommaso, Chris Jones, Jake Ruotolo, Salil Vadhan, and Jiyu Zhang. “Sparsest Cut and Eigenvalue Multiplicities on Low Degree Abelian Cayley Graphs”. In 28th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX ’25). in volume 353 of Leibniz International Proceedings in Informatics (LIPIcs) pages 16:1-16:20, Dagstuhl, Germany, 2025. Schloss Dagstuhl-Leibniz-Zentrum für Informatik: Alina Ene and Eshan Chattopadhyay, eds., Proceedings of the 28th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX ’25), 2025. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.16.
Sarathy, Jayshree, and Salil P. Vadhan. “Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression”. In 25th Privacy Enhancing Technologies Symposium (PoPETS ’25) . Washington, D.C.: Proceedings of the 25th Privacy Enhancing Technology Symposium (PoPETS ’25), volume 1, pages 216-235, 2025.
Sarathy, Jayshree, and Salil P. Vadhan. “Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression”. In 25th Privacy Enhancing Technologies Symposium (PoPETS ’25) . Washington, D.C.: Proceedings of the 25th Privacy Enhancing Technology Symposium (PoPETS ’25), volume 1, pages 216-235, 2025.
Canonne, Clément L., Francis E. Su, and Salil P. Vadhan. “The Randomness Complexity of Differential Privacy”. Leibniz International Proceedings in Informatics (LIPIcs) 325, no. Raghu Meka, editor, Proceedings of the 16th Innovations in Theoretical Computer Science Conference (ITCS 2025) (2025): 20.
Canonne, Clément L., Francis E. Su, and Salil P. Vadhan. “The Randomness Complexity of Differential Privacy”. Leibniz International Proceedings in Informatics (LIPIcs) 325, no. Raghu Meka, editor, Proceedings of the 16th Innovations in Theoretical Computer Science Conference (ITCS 2025) (2025): 20.
“Generalized and Unified Equivalences Between Hardness and Pseudoentropy”. Lecture Notes in Computer Science 16271, no. Benny Appelbaum and Huijia (Rachel) Lin, eds., Proceedings of the 23rd Annual Theory of Cryptography Conference (TCC ’25) (2025): 30.
“Generalized and Unified Equivalences Between Hardness and Pseudoentropy”. Lecture Notes in Computer Science 16271, no. Benny Appelbaum and Huijia (Rachel) Lin, eds., Proceedings of the 23rd Annual Theory of Cryptography Conference (TCC ’25) (2025): 30.