Beyond worst-case analysis in private singular vector computation
Interactive privacy via the median mechanism
Iterative Constructions and Private Data Release
Beating randomized response on incoherent matrices
The Price of Malice in Linear Congestion Games
Proceedings of the 42nd ACM symposium on Theory of computing - STOC ’10
Internet and Network Economics
Proceedings of the 44th symposium on Theory of Computing - STOC ’12
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC ’13
Lecture Notes in Computer Science
Moritz Hardt
Jonathan Ullman
Anupam Gupta
Tim Roughgarden
How robust are linear sketches to adaptive inputs?
How Well Can Congestion Pricing Neutralize Denial of Service Attacks?
How well can congestion pricing neutralize denial of service attacks?