Deterministic \(k\)-set structure
From MaRDI portal
Publication:975518
DOI10.1016/j.ipl.2008.08.010zbMath1193.68085OpenAlexW2032320979MaRDI QIDQ975518
Anirban Majumder, Sumit Ganguly
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.010
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The space complexity of approximating the frequency moments
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Set reconciliation with nearly optimal communication complexity
- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
- CR-precis: A Deterministic Summary Structure for Update Data Streams
- Combinatorial Algorithms for Compressed Sensing
- An improved data stream summary: the count-min sketch and its applications
- Fundamentals of Computation Theory
- Algorithms and Computation
- Compressed sensing
This page was built for publication: Deterministic \(k\)-set structure