Simons Investigator

Bibliographic References tagged with Simons Investigator

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
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.
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.
Ahmadinejad, AmirMahdi, Jonathan Kelner, Jack Murtagh, John Peebles, Aaron Sidford, and Salil Vadhan. “High-Precision Estimation of Random Walks in Small Space”. 61st Annual IEEE Symposium on the Foundations of Computer Science (FOCS 2020). IEEE, 2020.
Ahmadinejad, AmirMahdi, Jonathan Kelner, Jack Murtagh, John Peebles, Aaron Sidford, and Salil Vadhan. “High-Precision Estimation of Random Walks in Small Space”. 61st Annual IEEE Symposium on the Foundations of Computer Science (FOCS 2020). IEEE, 2020.
Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy II: IE Functions and Universal One-Way Hashing”. Theory of Computing 16, no. 8 (2020): 1-55.
Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy II: IE Functions and Universal One-Way Hashing”. Theory of Computing 16, no. 8 (2020): 1-55.
Bun, Mark, Jonathan Ullman, and Salil Vadhan. “Fingerprinting Codes and the Price of Approximate Differential Privacy”. SIAM Journal on Computing, Special Issue on STOC ’14 47, no. 5 (2018): 1888-1938.
Bun, Mark, Jonathan Ullman, and Salil Vadhan. “Fingerprinting Codes and the Price of Approximate Differential Privacy”. SIAM Journal on Computing, Special Issue on STOC ’14 47, no. 5 (2018): 1888-1938.
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.
Chen, Yiling, Or Sheffet, and Salil Vadhan. “Privacy Games”. ACM Transactions on Economics and Computation 8, no. 2 (2020): Article 9.
Chen, Yiling, Or Sheffet, and Salil Vadhan. “Privacy Games”. ACM Transactions on Economics and Computation 8, no. 2 (2020): Article 9.
Bun, Mark, Kobbi Nissim, Uri Stemmer, and Salil Vadhan. “Differentially Private Release and Learning of Threshold Functions”. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘15). IEEE, 2015.
Bun, Mark, Kobbi Nissim, Uri Stemmer, and Salil Vadhan. “Differentially Private Release and Learning of Threshold Functions”. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘15). IEEE, 2015.
Chen, Sitan, Thomas Steinke, and Salil P. Vadhan. “Pseudorandomness for Read-Once, Constant-Depth Circuits”. CoRR.
Chen, Sitan, Thomas Steinke, and Salil P. Vadhan. “Pseudorandomness for Read-Once, Constant-Depth Circuits”. CoRR.
Murtagh, Jack, and Salil Vadhan. “The Complexity of Computing the Optimal Composition of Differential Privacy”. Theory of Computing 14 (2018): 1-35.
Murtagh, Jack, and Salil Vadhan. “The Complexity of Computing the Optimal Composition of Differential Privacy”. Theory of Computing 14 (2018): 1-35.