- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i9 |      | Karthekeyan Chandrasekaran, Justin Thaler, Jonathan Ullman, Andrew Wan: Faster Private Release of Marginals on Small Databases. CoRR abs/1304.3754 (2013) |
| 2012 | ||
| c7 | | Justin Thaler, Jonathan Ullman, Salil P. Vadhan: Faster Algorithms for Privately Releasing Marginals. ICALP (1) 2012: 810-821 |
| c6 | | Anupam Gupta, Aaron Roth, Jonathan Ullman: Iterative Constructions and Private Data Release. TCC 2012: 339-356 |
| i8 | | Justin Thaler, Jonathan Ullman, Salil P. Vadhan: Faster Algorithms for Privately Releasing Marginals. CoRR abs/1205.1758 (2012) |
| i7 | | Michael Kearns, Mallesh M. Pai, Aaron Roth, Jonathan Ullman: Mechanism Design in Large Games: Incentives and Privacy. CoRR abs/1207.4084 (2012) |
| i6 | | Jonathan Ullman: Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard. CoRR abs/1207.6945 (2012) |
| i5 | | Justin Hsu, Aaron Roth, Jonathan Ullman: Differential Privacy for the Analyst via Private Equilibrium Computation. CoRR abs/1211.0877 (2012) |
| 2011 | ||
| c5 | | Ian A. Kash, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman: On the zero-error capacity threshold for deletion channels. ITA 2011: 285-289 |
| c4 | | Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman: Privately releasing conjunctions and the statistical query barrier. STOC 2011: 803-812 |
| c3 | | Jonathan Ullman, Salil P. Vadhan: PCPs and the Hardness of Generating Private Synthetic Data. TCC 2011: 400-416 |
| i4 | | Ian A. Kash, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman: On the Zero-Error Capacity Threshold for Deletion Channels. CoRR abs/1102.0040 (2011) |
| i3 | | Anupam Gupta, Aaron Roth, Jonathan Ullman: Iterative Constructions and Private Data Release. CoRR abs/1107.3731 (2011) |
| 2010 | ||
| c2 | | Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam Smith, Jonathan Ullman: The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. STOC 2010: 775-784 |
| c1 | | Scott Duke Kominers, Mike Ruberry, Jonathan Ullman: Course Allocation by Proxy Auction. WINE 2010: 551-558 |
| i2 | | Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman: Privately Releasing Conjunctions and the Statistical Query Barrier. CoRR abs/1011.1296 (2010) |
| i1 | | Jonathan Ullman, Salil P. Vadhan: PCPs and the Hardness of Generating Synthetic Data. Electronic Colloquium on Computational Complexity (ECCC) 17: 17 (2010) |
| 1 | Karthekeyan Chandrasekaran | |
| 2 | Anupam Gupta | |
| 3 | Moritz Hardt | |
| 4 | Justin Hsu | |
| 5 | Ian A. Kash | |
| 6 | Shiva Prasad Kasiviswanathan | |
| 7 | Michael Kearns (Michael J. Kearns, Michael S. Kearns) | |
| 8 | Scott Duke Kominers (Scott D. Kominers) | |
| 9 | Michael Mitzenmacher | |
| 10 | Mallesh M. Pai | |
| 11 | Aaron Roth | |
| 12 | Mike Ruberry | |
| 13 | Mark Rudelson | |
| 14 | Adam D. Smith (Adam Smith) | |
| 15 | Justin Thaler | |
| 16 | Salil P. Vadhan | |
| 17 | Andrew Wan |
Colors in the list of coauthors
Last update Wed May 22 09:21:05 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page