Jonathan R. Ullman, Ph.D. - Publications
Affiliations: | 2013 | Engineering and Applied Sciences | Harvard University, Cambridge, MA, United States |
Year | Citation | Score | |||
---|---|---|---|---|---|
2020 | Ullman J, Vadhan S. PCPs and the Hardness of Generating Synthetic Data Journal of Cryptology. 1-35. DOI: 10.1007/S00145-020-09363-Y | 0.583 | |||
2017 | Afrati FN, Sharma S, Ullman JR, Ullman JD. Computing marginals using MapReduce Journal of Computer and System Sciences. 94: 98-117. DOI: 10.1016/J.Jcss.2017.02.007 | 0.306 | |||
2016 | Ullman J. Answering n2+o(1) Counting queries with differential privacy is hard Siam Journal On Computing. 45: 473-496. DOI: 10.1137/130928121 | 0.52 | |||
2016 | HubáăźEk P, Naor M, Ullman J. When Can Limited Randomness Be Used in Repeated Games Theory of Computing Systems \/ Mathematical Systems Theory. 59: 722-746. DOI: 10.1007/S00224-016-9690-4 | 0.332 | |||
2015 | Roth A, Ullman J, Wu ZS. Watch and learn: optimizing from revealed preferences feedback Sigecom Exchanges. 14: 101-104. DOI: 10.1145/2845926.2845934 | 0.383 | |||
2013 | Gupta A, Hardt M, Roth A, Ullman J. Privately releasing conjunctions and the statistical Quer y Barrier Siam Journal On Computing. 42: 1494-1520. DOI: 10.1137/110857714 | 0.526 | |||
Show low-probability matches. |