Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
From MaRDI portal
Publication:2941497
Recommendations
Cites work
- Approximate distance oracles
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Fast C-K-R partitions of sparse graphs
- Near-Linear Time Construction of Sparse Neighborhood Covers
- On approximate distance labels and routing schemes with affine stretch
- On sparse spanners of weighted graphs
- Ramsey partitions and proximity data structures
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- Shortest-path queries in static networks
Cited in
(3)
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)