Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan. On the complexity of differentially private data release: efficient algorithms and hardness results. In Michael Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. pages 381-390, ACM, 2009. [doi]
@inproceedings{DworkNRRV09,
title = {On the complexity of differentially private data release: efficient algorithms and hardness results},
author = {Cynthia Dwork and Moni Naor and Omer Reingold and Guy N. Rothblum and Salil P. Vadhan},
year = {2009},
doi = {10.1145/1536414.1536467},
url = {http://doi.acm.org/10.1145/1536414.1536467},
tags = {data-flow},
researchr = {https://researchr.org/publication/DworkNRRV09},
cites = {0},
citedby = {0},
pages = {381-390},
booktitle = {Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
editor = {Michael Mitzenmacher},
publisher = {ACM},
isbn = {978-1-60558-506-2},
}