# Jonathan Ullman

According to our database

Collaborative distances:

^{1}, Jonathan Ullman authored at least 39 papers between 2010 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

The Limits of Post-Selection Generalization.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Local Differential Privacy for Evolving Data.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Skyline Identification in Multi-Arm Bandits.

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Hardness of Non-interactive Differential Privacy from One-Way Functions.

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

An Antifolk Theorem for Large Repeated Games.

ACM Trans. Economics and Comput., 2017

Technical Perspective: Building a safety net for data reuse.

Commun. ACM, 2017

Make Up Your Mind: The Price of Online Queries in Differential Privacy.

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Multidimensional Dynamic Pricing for Welfare Maximization.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Tight Lower Bounds for Differentially Private Selection.

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

The Price of Selection in Differential Privacy.

Proceedings of the 30th Conference on Learning Theory, 2017

Fractional Set Cover in the Streaming Model.

Proceedings of the Approximation, 2017

2016

Query Release via Online Learning.

Encyclopedia of Algorithms, 2016

Answering n

^{2+o(1)}Counting Queries with Differential Privacy is Hard.
SIAM J. Comput., 2016

Strong Hardness of Privacy from Weak Traitor Tracing.

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Watch and learn: optimizing from revealed preferences feedback.

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Algorithmic stability for adaptive data analysis.

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Space Lower Bounds for Itemset Frequency Sketches.

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Privacy Odometers and Filters: Pay-as-you-Go Composition.

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Interactive fingerprinting codes and the hardness of preventing false discovery.

Proceedings of the 2016 Information Theory and Applications Workshop, 2016

2015

Inducing Approximately Optimal Flow Using Truthful Mediators.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

When Can Limited Randomness Be Used in Repeated Games?

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Private Multiplicative Weights Beyond Linear Queries.

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Robust Traceability from Trace Amounts.

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery.

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Fingerprinting codes and the price of approximate differential privacy.

Proceedings of the Symposium on Theory of Computing, 2014

Mechanism design in large games: incentives and privacy.

Proceedings of the Innovations in Theoretical Computer Science, 2014

Faster private release of marginals on small databases.

Proceedings of the Innovations in Theoretical Computer Science, 2014

Privately Solving Linear Programs.

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Preventing False Discovery in Interactive Data Analysis Is Hard.

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Answering n

_{{2+o(1)}}counting queries with differential privacy is hard.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Differential privacy for the analyst via private equilibrium computation.

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Iterative Constructions and Private Data Release.

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Faster Algorithms for Privately Releasing Marginals.

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

PCPs and the Hardness of Generating Private Synthetic Data.

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Privately releasing conjunctions and the statistical query barrier.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

On the zero-error capacity threshold for deletion channels.

Proceedings of the Information Theory and Applications Workshop, 2011

2010

PCPs and the Hardness of Generating Synthetic Data.

Electronic Colloquium on Computational Complexity (ECCC), 2010

Course Allocation by Proxy Auction.

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

The price of privately releasing contingency tables and the spectra of random matrices with correlated rows.

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010