On derandomizing algorithms that err extremely rarely
From MaRDI portal
Publication:5259544
DOI10.1145/2591796.2591808zbMath1315.68152OpenAlexW1964557893MaRDI QIDQ5259544
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2591796.2591808
Analysis of algorithms and problem complexity (68Q25) Random number generation in numerical analysis (65C10) Randomized algorithms (68W20)
Related Items
Unnamed Item, Quantified Derandomization: How to Find Water in the Ocean, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Near-optimal pseudorandom generators for constant-depth read-once formulas, Improved bounds for quantified derandomization of constant-depth circuits and polynomials, On hitting-set generators for polynomials that vanish rarely
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
