Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
DOI10.1145/2746539.2746540zbMATH Open1321.68317OpenAlexW1965877824MaRDI QIDQ2941497FDOQ2941497
Authors: Shachar Lovett, Jiapeng Zhang 
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2746539.2746540
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Shortest-path queries in static networks
- Approximate distance oracles
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On approximate distance labels and routing schemes with affine stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Approximate distance oracles with constant query time
- Fast C-K-R partitions of sparse graphs
- Automata, Languages and Programming
- Ramsey partitions and proximity data structures
Cited In (3)
Uses Software
This page was built for publication: Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941497)
