# Publications

, “ , “

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities”, Automata, Languages, and Programming, vol. 7965, pp. 303-314, 2013. DOIAbstract PDF

, “ Faster Private Release of Marginals on Small Databases”, CoRR, vol. abs/1304.3754, 2013. arXiv.orgAbstract PDF

, “ Putting Health IT on the Path to Success”, JAMA, vol. 309, no. 10, pp. 989-990, 2013. DOIAbstract PDF

, “ Survey of Publicly Available State Health Databases”, Data Privacy Lab, IQSS, Harvard University. 2013. Project website PDF

, “ Identifying Participants in the Personal Genome Project by Name”, Data Privacy Lab, IQSS, Harvard University. 2013. Project website PDF

, “ Matching Known Patients to Health Records in Washington State Data”, Data Privacy Lab, IQSS, Harvard University. 2013. Project website PDF

, “ Answering n

, “_{{2+o(1)}}counting queries with differential privacy is hard”, in Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, Palo Alto, California, USA, 2013, pp. 361-370. DOIAbstract PDF Differential privacy for the analyst via private equilibrium computation”, in Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, Palo Alto, California, USA, 2013, pp. 341-350. DOIAbstract PDF

, “ Interactive proofs of proximity: delegating computation in sublinear time”, in Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, Palo Alto, California, USA, 2013, pp. 793-802. DOIAbstract PDF

, “ Truthful mechanisms for agents that value privacy”, in Proceedings of the fourteenth ACM conference on Electronic commerce, Philadelphia, Pennsylvania, USA, 2013, pp. 215-232. DOIAbstract PDF

, “ Discrimination in online ad delivery”, Commun. ACM, vol. 56, no. 5, pp. 44–54, 2013. DOIAbstract PDF

, “ Analyzing Graphs with Node Differential Privacy”, in Theory of Cryptography, vol. 7785, Springer Berlin Heidelberg, 2013, pp. 457-476. Springer LinkAbstract PDF

, “ Characterizing the sample complexity of private learners”, in Proceedings of the 4th conference on Innovations in Theoretical Computer Science, Berkeley, California, USA, 2013, pp. 97-110. DOIAbstract PDF

, “ Iterative Constructions and Private Data Release”, in Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, 2012, Lecture Notes in Computer Science., vol. 7194, pp. 339-356. DOI:10.1007/978-3-642-28914-9_19Abstract PDF

, “ The Privacy of the Analyst and the Power of the State”, in Proceedings of the 53rd Annual {IEEE} Symposium on Foundations of Computer Science (FOCS `12), New Brunswick, NJ, 2012, pp. 400–409. IEEE XploreAbstract PDF

, “ Differential Privacy with Imperfect Randomness”, in Proceedings of the 32nd International Cryptology Conference (CRYPTO `12), Santa Barbara, CA, 2012, Lecture Notes on Computer Science., vol. 7417, pp. 497–516. Springer LinkAbstract PDF

, “ Faster Algorithms for Privately Releasing Marginals”, in Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, Lecture Notes in Computer Science., vol. 7391. DOI:10.1007/978-3-642-31594-7_68Abstract PDF

, “ , “- 1 of 2
- ››