Jonathan R. Ullman, Ph.D.
Affiliations: | 2013 | Engineering and Applied Sciences | Harvard University, Cambridge, MA, United States |
Google:
"Jonathan Ullman"Parents
Sign in to add mentor| Salil P. Vadhan | grad student | 2013 | Harvard | |
| (Privacy and the complexity of simple queries.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Ullman J, Vadhan S. (2020) PCPs and the Hardness of Generating Synthetic Data Journal of Cryptology. 1-35 |
| Afrati FN, Sharma S, Ullman JR, et al. (2017) Computing marginals using MapReduce Journal of Computer and System Sciences. 94: 98-117 |
| Ullman J. (2016) Answering n2+o(1) Counting queries with differential privacy is hard Siam Journal On Computing. 45: 473-496 |
| HubáăźEk P, Naor M, Ullman J. (2016) When Can Limited Randomness Be Used in Repeated Games Theory of Computing Systems \/ Mathematical Systems Theory. 59: 722-746 |
| Roth A, Ullman J, Wu ZS. (2015) Watch and learn: optimizing from revealed preferences feedback Sigecom Exchanges. 14: 101-104 |
| Gupta A, Hardt M, Roth A, et al. (2013) Privately releasing conjunctions and the statistical Quer y Barrier Siam Journal On Computing. 42: 1494-1520 |