Jonathan Ullman

Postdoctoral Fellow at
Harvard University CRCS
110 Maxwell Dworkin
33 Oxford St
Cambridge, MA, 02138

e-mail: jullman [at] seas [dot] harvard [dot] edu


About Me

I am postdoctoral fellow at Harvard University in the Center for Research on Computation and Society (CRCS). I am interested in theoretical computer science. More specifically, I work on algorithms for privacy-preserving data analysis and their connection to other areas of computer science such as cryptography, mechanism design, and learning theory.

I completed my Ph.D., also at Harvard University, in 2013. I had the very good fortune to be advised by Salil Vadhan.

Recent News



Research Papers (in reverse chronological order)

Privately Solving Linear Programs [Abstract] [arXiv]
Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan Ullman
To appear in ICALP 2014 (Track A) - International Colloquium on Automata, Languages, and Programming

An Anti-Folk Theorem for Large Repeated Games with Imperfect Monitoring [Abstract][arXiv]
Mallesh Pai, Aaron Roth, Jonathan Ullman
Manuscript

Fingerprinting Codes and the Price of Approximate Differential Privacy [Abstract][arXiv]
Mark Bun, Jonathan Ullman, Salil Vadhan
To appear in STOC 2014 - Symposium on Theory of Computing

Faster Private Release of Marginals on Small Databases [Abstract][arXiv]
Karthekeyan Chandrasekaran, Justin Thaler, Jonathan Ullman, Andrew Wan
ITCS 2014 - Innovations in Theoretical Computer Science

Differential Privacy for the Analyst via Private Equilibrium Computation [Abstract][arXiv]
Justin Hsu, Aaron Roth, Jonathan Ullman
STOC 2013 - Symposium on Theory of Computing

Answering n2+o(1) Counting Queries with Differential Privacy is Hard [Abstract][arXiv]
Jonathan Ullman
STOC 2013 - Symposium on Theory of Computing
Invited to the special issue of SICOMP for selected papers from STOC 2013.
To appear in SICOMP - Special issue for selected papers from STOC 2013

Mechanism Design in Large Games: Incentives and Privacy [Abstract][arXiv]
Michael Kearns, Mallesh Pai, Aaron Roth, Jonathan Ullman
ITCS 2014 - Innovations in Theoretical Computer Science

Faster Algorithms for Privately Releasing Marginals [Abstract][arXiv]
Justin Thaler, Jonathan Ullman, Salil Vadhan
ICALP 2012 (Track A) - International Colloquium on Automata, Languages, and Programming

Iterative Constructions and Private Data Release [Abstract][arXiv]
Anupam Gupta, Aaron Roth, Jonathan Ullman
TCC 2012 - Theory of Cryptography Conference

On the Zero-Error Capacity Threshold for Deletion Channels [Abstract][arXiv]
Ian Kash, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman
ITA 2011 - Information Theory and Applications Workshop

Privately Releasing Conjunctions and the Statistical Query Barrier [Abstract][arXiv]
Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman
STOC 2011 - Symposium on Theory of Computing
SICOMP - SIAM Journal on Computing

Course Allocation by Proxy Auction [Abstract]
Scott Kominers, Mike Ruberry, Jonathan Ullman
WINE 2010 - Workshop on Internet and Economics

PCPs and the Hardness of Generating Private Synthetic Data [Abstract] [ECCC]
Salil Vadhan, Jonathan Ullman
TCC 2011 - Theory of Cryptography Conference
Invited to the Journal of Cryptology

The Price of Privately Releasing Contingency Tables and the Spectra of Random Matrices with Correlated Rows [Abstract]
Shiva Kasiviswanathan, Mark Rudelson, Adam Smith, Jonathan Ullman
STOC 2010 - Symposium on Theory of Computing



Teaching



Academic Service

I have served (or will soon serve) on the following program committees: TCC 2015


Last Updated

April 16, 2014