_2/ _2-foreach sparse recovery with low risk

DOI10.1007/978-3-642-39206-1_39MaRDI QIDQ5326583zbMATH OpenOpenAlexFDO

Authors Ely Porat, Atri Rudra, A. Gilbert, Hung Q. Ngo, M. Strauss

Publication date 6 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39206-1_39

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Lower bounds for sparse recovery
• Lower bounds for adaptive sparse recovery
• On low-risk heavy hitters and sparse recovery schemes

Cited in

(8)

• Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
• On low-risk heavy hitters and sparse recovery schemes
• Local list recovery of high-rate tensor codes and applications
• Lower bounds for sparse recovery
• Lower bounds for adaptive sparse recovery
• Nearly optimal pseudorandomness from hardness
• Deterministic sparse Fourier transform with an _ guarantee
• Near-optimal list-recovery of linear code families

This page was built for publication: \(\ell _{2}/\ell _{2}\)-foreach sparse recovery with low risk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326583)