Algorithms and Computation
From MaRDI portal
Publication:5897883
DOI10.1007/11602613zbMATH Open1173.68494OpenAlexW2304246803MaRDI QIDQ5897883FDOQ5897883
Authors: Sumit Ganguly 
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Recommendations
- Counting distinct items over update streams
- scientific article; zbMATH DE number 2019620
- Probabilistic counting algorithms for data base applications
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Information storage and retrieval of data (68P20) Analysis of algorithms (68W40) Database theory (68P15)
Cited In (7)
- Efficient exact algorithm for count distinct problem
- Deterministic \(k\)-set structure
- Title not available (Why is that?)
- Counting distinct items over update streams
- On the I/O complexity of dynamic distinct counting
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
This page was built for publication: Algorithms and Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897883)
