The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs
A PTAS for Computing the Supremum of Gaussian Processes
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy
Making the Long Code Shorter
The Privacy of the Analyst and the Power of the State