Jonathan Ullman

Assistant Professor
College of Computer and Information Sciences
Northeastern University

260 West Village H
440 Huntington Avenue
Boston, MA, 02115

e-mail: jullman [at] ccs [dot] neu [dot] edu

About Me

I am interested in theoretical computer science broadly. Much of my work addresses with questions like when and how can we analyze a dataset while ensuring privacy for the individuals in the dataset and how can we prevent false discovery in the empirical sciences. I study these questions and others using tools from cryptography, computational learning theory, algorithms, and game theory.

Since Fall 2015, I have been an assistant professor in the College of Computer and Information Sciences at Northeastern University, where I am affiliated with the theory group and the security group. Prior to joining Northeastern I completed my PhD at Harvard University under the supervision of Salil Vadhan. I was also a postdoctoral fellow in the Center for Research on Computation and Society and in the inaugural class of junior fellows in the Simons Society of Fellows.

If you are a bright and motivated student interested in theoretical computer science, I highly encourage you to apply to Northeastern! See here for more information.

Recent News


Recent/Selected Research Papers   [All Papers]All Research Papers   [Selected Papers]   [Google Scholar]

  • Privacy Odometers and Filters: Pay-as-you-Go Composition
    Ryan Rogers, Aaron Roth, Jonathan Ullman, Salil Vadhan
  • Strong Hardness of Privacy from Weak Traitor Tracing
    Lucas Kowalczyk, Tal Malkin, Jonathan Ullman, Mark Zhandry
  • Make Up Your Mind: The Price of Online Queries in Differential Privacy
    Mark Bun, Thomas Steinke, Jonathan Ullman
  • Computing Marginals Using MapReduce
    Foto Afrati, Shantanu Sharma, Jeffrey D. Ullman, Jonathan Ullman
  • An Anti-Folk Theorem for Large Repeated Games with Imperfect Monitoring
    Mallesh Pai, Aaron Roth, Jonathan Ullman
  • Some Pairs Problems
    Jeffrey D. Ullman, Jonathan Ullman
    BeyondMR 2016
  • Space Lower Bounds for Itemset Frequency Sketches
    Edo Liberty, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman
    PODS 2016
  • Algorithmic Stability for Adaptive Data Analysis
    Raef Bassily, Kobbi Nissim, Uri Stemmer, Adam Smith, Thomas Steinke, Jonathan Ullman
    STOC 2016
  • Watch and Learn: Optimizing from Revealed Preferences Feedback
    Aaron Roth, Jonathan Ullman, Zhiwei Steven Wu
    STOC 2016
  • When Can Limited Randomness Be Used in Repeated Games?
    Pavel Hubacek, Moni Naor, Jonathan Ullman
    SAGT 2015; TCS special issue for selected papers from SAGT 2014/15
  • Robust Traceability from Trace Amounts
    Cynthia Dwork, Adam Smith, Thomas Steinke, Jonathan Ullman, Salil Vadhan
    FOCS 2015
  • Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery
    Thomas Steinke, Jonathan Ullman
    COLT 2015
  • Inducing Approximately Optimal Flow Using Truthful Mediators
    Ryan Rogers, Aaron Roth, Jonathan Ullman, Zhiwei Steven Wu
    EC 2015
  • Between Pure and Approximate Differential Privacy
    Thomas Steinke, Jonathan Ullman
    TPDP 2015
  • Private Multiplicative Weights Beyond Linear Queries
    Jonathan Ullman
    PODS 2015
  • Preventing False Discovery in Interactive Data Analysis is Hard
    Moritz Hardt, Jonathan Ullman
    FOCS 2014
  • Privately Solving Linear Programs
    Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan Ullman
    ICALP 2014 Track A
  • Fingerprinting Codes and the Price of Approximate Differential Privacy
    Mark Bun, Jonathan Ullman, Salil Vadhan
    STOC 2014; Invited to the special issue of SICOMP
  • Faster Private Release of Marginals on Small Databases
    Karthekeyan Chandrasekaran, Justin Thaler, Jonathan Ullman, Andrew Wan
    ITCS 2014
  • Robust Mediators in Large Games
    Michael Kearns, Mallesh Pai, Ryan Rogers, Aaron Roth, Jonathan Ullman
    ITCS 2014
  • Differential Privacy for the Analyst via Private Equilibrium Computation
    Justin Hsu, Aaron Roth, Jonathan Ullman
    STOC 2013
  • Answering n2+o(1) Counting Queries with Differential Privacy is Hard
    Jonathan Ullman
    STOC 2013; SICOMP special issue for selected papers from STOC 2013
  • Faster Algorithms for Privately Releasing Marginals
    Justin Thaler, Jonathan Ullman, Salil Vadhan
    ICALP 2012 Track A
  • Iterative Constructions and Private Data Release
    Anupam Gupta, Aaron Roth, Jonathan Ullman
    TCC 2012
  • On the Zero-Error Capacity Threshold for Deletion Channels
    Ian Kash, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman
    ITA 2011
  • Privately Releasing Conjunctions and the Statistical Query Barrier
    Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman
    STOC 2011; SICOMP
  • PCPs and the Hardness of Generating Private Synthetic Data
    Jonathan Ullman, Salil Vadhan
    TCC 2011; Invited to the Journal of Cryptology
  • Course Allocation by Proxy Auction
    Scott Kominers, Mike Ruberry, Jonathan Ullman
    WINE 2010
  • The Price of Privately Releasing Contingency Tables and the Spectra of Random Matrices with Correlated Rows
    Shiva Kasiviswanathan, Mark Rudelson, Adam Smith, Jonathan Ullman
    STOC 2010

Academic Service

I have been, or currently am, a member of the program committee or a reviewer for the following:

Last Updated

May 27, 2016.