Jonathan Ullman
Ph.D. Candidate
Harvard School of Engineering and Applied Sciences
Maxwell Dworkin 138
33 Oxford St
Cambridge, MA, 02138
jullman [at] seas [dot] harvard [dot] edu
I am a third-year Ph.D. student in Computer Science at Harvard University, where I am very fortunate to have Salil Vadhan as my advisor. This academic year I am visiting Microsoft Research Silicon Valley as an intern and Stanford University as a visiting student. My reseach has focused on Privacy-Preserving Data Analysis and I am also interested in Cryptography and Complexity Theory. Before coming to Harvard, I graduated from Princeton University in 2008. In my spare time I like to play bridge, though I am actually pictured playing gin.

Research Papers (in reverse chronological order)

Faster Algorithms for Privately Releasing Marginals
with Justin Thaler and Salil Vadhan
International Colloquium on Automata, Languages, and Programming (ICALP), 2012.
Iterative Constructions and Private Data Release
with Anupam Gupta and Aaron Roth
Theory of Cryptography Conference (TCC), 2012
On the Zero-Error Capacity Threshold for Deletion Channels
with Ian A. Kash, Michael Mitzenmacher, and Justin Thaler
Information Theory and Applications Workshop (ITA), 2011
Privately Releasing Conjunctions and the Statistical Query Barrier
with Anupam Gupta, Moritz Hardt, and Aaron Roth
ACM Symposium on Theory of Computing (STOC), 2011
Course Allocation by Proxy Auction
with Scott Duke Kominers and Mike Ruberry
Workshop on Internet and Network Economics (WINE), 2010
PCPs and the Hardness of Generating Private Synthetic Data
with Salil Vadhan
Theory of Cryptography Conference (TCC), 2011
Invited to Journal of Cryptology
The Price of Privately Releasing Contingency Tables and the Spectra of Random Matrices with Correlated Rows
with Shiva Kasiviswanathan, Mark Rudelson, and Adam Smith
ACM Symposium on Theory of Computing (STOC), 2010
Last updated 5/7/2012.