ACM - Normas
Moritz Hardt
Aaron Roth
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC ’13
Towards Sharp Inapproximability For Any 2-CSP
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
Beating randomized response on incoherent matrices
Iterative Constructions and Private Data Release
Boosting and Differential Privacy
Revealing information while preserving privacy