Counting large numbers of events in small registers
From MaRDI portal
Publication:4167561
DOI10.1145/359619.359627zbMath0386.68035OpenAlexW2064710146WikidataQ57482563 ScholiaQ57482563MaRDI QIDQ4167561
No author found.
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359619.359627
Related Items (20)
\(q\)-distributions and Markov processes ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space ⋮ A flexible way of counting large numbers approximately in small registers ⋮ Improving linear cryptanalysis of LOKI91 by probabilistic counting method ⋮ Learned sketches for frequency estimation ⋮ Statistical estimation with bounded memory ⋮ Improved algorithms for polynomial-time decay and time-decay with additive error ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Applying approximate counting for computing the frequency moments of long data streams ⋮ Approximate counting : an alternative approach ⋮ How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems ⋮ Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. ⋮ The Big Match in Small Space ⋮ Approximate counting:a martingale approach ⋮ Unnamed Item ⋮ Approximate counting: a detailed analysis ⋮ The space complexity of approximating the frequency moments ⋮ Probabilistic counting algorithms for data base applications
This page was built for publication: Counting large numbers of events in small registers
