TY  - JOUR
ID  - cs-12-1
TI  - An improved data stream summary: the count-min sketch and its applications
AU  - Cormode, Graham
AU  - Muthukrishnan, S.
JO  - Journal of Algorithms
PY  - 2005
DO  - 10.1016/j.jalgor.2003.12.001
UR  - https://www.cs.ox.ac.uk/people/graham.cormode/pubs/papers/cm-full.pdf
ER  - 


TY  - JOUR
ID  - cs-12-2
TI  - HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
AU  - Flajolet, Philippe
AU  - Fusy, Éric
AU  - Gandouet, Olivier
AU  - Meunier, Frédéric
JO  - Discrete Mathematics & Theoretical Computer Science
PY  - 2007
DO  - 10.46298/dmtcs.3545
UR  - https://dmtcs.episciences.org/articles/3545
ER  - 


TY  - CONF
ID  - cs-12-3
TI  - Finding Frequent Items in Data Streams
AU  - Charikar, Moses
AU  - Chen, Kevin
AU  - Farach-Colton, Martin
T2  - Lecture Notes in Computer Science; Automata, Languages and Programming
PY  - 2002
DO  - 10.1007/3-540-45465-9_59
UR  - https://www.cs.yale.edu/homes/el327/datamining2011aFiles/FindingFrequentItemsInDataStreams.pdf
ER  -