Algorithm 247: Radical-inverse quasi-random point sequence
J. H. Halton · 1964
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Earlier work this paper cites.
An ad omnia approach to defining and achieving private data analysis
Cynthia Dwork · 2007
Earlier work this paper cites.
Noisy binary search and its applications
Richard M Karp and Robert Kleinberg · 2007
Earlier work this paper cites.
Smooth sensitivity and sampling in private data analysis
Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith · 2007
Earlier work this paper cites.
The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well)
Michael Ben-Or and Avinatan Hassidim · 2008
Earlier work this paper cites.
TPC-H benchmark specification
Transaction Processing Performance Council · 2008
Earlier work this paper cites.
The differential privacy frontier
Cynthia Dwork · 2009
Earlier work this paper cites.
Releasing search queries and clicks privately
Aleksandra Korolova, Krishnaram Kenthapadi, Nina Mishra, and Alexandros Ntoulas · 2009
Earlier work this paper cites.
Privacy integrated queries: an extensible platform for privacy-preserving data analysis
Frank D McSherry · 2009
Earlier work this paper cites.
Pan-private streaming algorithms
Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N Rothblum, and Sergey Yekhanin · 2010
Earlier work this paper cites.
Publishing search logs—a comparative study of privacy guarantees
Michaela Gotz, Ashwin Machanavajjhala, Guozhang Wang, Xiaokui Xiao, and Johannes Gehrke · 2011
Earlier work this paper cites.
No free lunch in data privacy
Daniel Kifer and Ashwin Machanavajjhala · 2011
Earlier work this paper cites.
How much is enough? choosing ε \varepsilon for differential privacy
Jaewoo Lee and Chris Clifton · 2011
Earlier work this paper cites.