Efficient sampling of non-strict turnstile data streams
From MaRDI portal
Publication:2348042
DOI10.1016/j.tcs.2015.01.026zbMath1328.62020OpenAlexW1980388398MaRDI QIDQ2348042
Ely Porat, Neta Barkay, Bar Shalem
Publication date: 10 June 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.026
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting distinct items over update streams
- A Small Approximately Min-Wise Independent Family of Hash Functions
- Approximate sparse recovery
- Polynomial Codes Over Certain Finite Fields
- Improved Sketching of Hamming Distance with Error Correcting
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- Uniform Hashing in Constant Time and Optimal Space
- Balls and bins: A study in negative dependence
- Sampling in dynamic data streams and applications