| 2012 | ||
|---|---|---|
| 21 | Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel: Fairness through awareness. ITCS 2012: 214-226 | |
| 20 | Moritz Hardt, Nikhil Srivastava, Madhur Tulsiani: Graph densification. ITCS 2012: 380-392 | |
| 19 | Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio: Private data release via learning thresholds. SODA 2012: 168-187 | |
| 18 | Moritz Hardt, Aaron Roth: Beating randomized response on incoherent matrices. STOC 2012: 1255-1268 | |
| 2011 | ||
| 17 | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Mathematical Relaxations and Average-case Complexity. SODA 2011: 512-531 | |
| 16 | Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman: Privately releasing conjunctions and the statistical query barrier. STOC 2011: 803-812 | |
| 15 | Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel: Fairness Through Awareness CoRR abs/1104.3913: (2011) | |
| 14 | Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio: Private Data Release via Learning Thresholds CoRR abs/1107.2444: (2011) | |
| 13 | Moritz Hardt, Aaron Roth: Beating Randomized Response on Incoherent Matrices CoRR abs/1111.0623: (2011) | |
| 2010 | ||
| 12 | Moritz Hardt, Guy N. Rothblum: A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis. FOCS 2010: 61-70 | |
| 11 | Moritz Hardt, Kunal Talwar: On the geometry of differential privacy. STOC 2010: 705-714 | |
| 10 | Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman: Privately Releasing Conjunctions and the Statistical Query Barrier CoRR abs/1011.1296: (2010) | |
| 9 | Moritz Hardt, Katrina Ligett, Frank McSherry: A simple and practical algorithm for differentially private data release CoRR abs/1012.4763: (2010) | |
| 2009 | ||
| 8 | Boaz Barak, Moritz Hardt, Satyen Kale: The uniform hardcore lemma via approximate Bregman projections. SODA 2009: 1193-1200 | |
| 7 | Moritz Hardt, Kunal Talwar: On the Geometry of Differential Privacy CoRR abs/0907.3754: (2009) | |
| 6 | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere CoRR abs/0911.5526: (2009) | |
| 5 | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electronic Colloquium on Computational Complexity (ECCC) 16: 129 (2009) | |
| 4 | Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi: Deterministically testing sparse polynomial identities of unbounded degree. Inf. Process. Lett. 109(3): 187-192 (2009) | |
| 2008 | ||
| 3 | Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer: Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383 | |
| 2 | Markus Bläser, Moritz Hardt, David Steurer: Asymptotically Optimal Hitting Sets Against Polynomials. ICALP (1) 2008: 345-356 | |
| 2007 | ||
| 1 | Moritz Hardt, Gert Smolka: Higher-Order Syntax and Saturation Algorithms for Hybrid Logic. Electr. Notes Theor. Comput. Sci. 174(6): 15-27 (2007) | |
| 1 | Boaz Barak | [3] [5] [6] [8] [17] |
| 2 | Markus Bläser | [2] [4] |
| 3 | Cynthia Dwork | [15] [21] |
| 4 | Anupam Gupta | [10] [16] |
| 5 | Ishay Haviv | [3] |
| 6 | Thomas Holenstein | [5] [6] [17] |
| 7 | Satyen Kale | [8] |
| 8 | Katrina Ligett | [9] |
| 9 | Richard J. Lipton | [4] |
| 10 | Frank McSherry | [9] |
| 11 | Toniann Pitassi | [15] [21] |
| 12 | Anup Rao | [3] |
| 13 | Oded Regev | [3] |
| 14 | Omer Reingold | [15] [21] |
| 15 | Aaron Roth | [10] [13] [16] [18] |
| 16 | Guy N. Rothblum | [12] [14] [19] |
| 17 | Rocco A. Servedio | [14] [19] |
| 18 | Gert Smolka | [1] |
| 19 | Nikhil Srivastava | [20] |
| 20 | David Steurer | [2] [3] [5] [6] [17] |
| 21 | Kunal Talwar | [7] [11] |
| 22 | Madhur Tulsiani | [20] |
| 23 | Jonathan Ullman | [10] [16] |
| 24 | Nisheeth K. Vishnoi | [4] |
| 25 | Richard S. Zemel | [15] [21] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page