On the measurement complexity of differentially private query answering
From MaRDI portal
Publication:5046476
DOI10.1007/s11432-015-5306-xzbMath1497.94124OpenAlexW2185690170MaRDI QIDQ5046476
No author found.
Publication date: 28 October 2022
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-015-5306-x
Cites Work
- PAC-Bayesian stochastic model selection
- Improved boosting algorithms using confidence-rated predictions
- Interactive privacy via the median mechanism
- What Can We Learn Privately?
- Pion-Nucleon Scattering in the Mandelstam Representation
- Tracing traitors
- On the complexity of differentially private data release
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: On the measurement complexity of differentially private query answering