Approximate counting is an algorithm proposed by R. Morris which makes it possible to keep approximate counts of large numbers in small counters. The algorithm is useful for gathering statistics of a large number of events as well as for applications related to data compression (Todd et al.). We provide here a complete analysis of approximate counting which establishes good convergence properties of the algorithm and allows to quantify precisely complexity-accuracy tradeoffs. © 1985 BIT Foundations.
CITATION STYLE
Flajolet, P. (1985). Approximate counting: A detailed analysis. BIT, 25(1), 113–134. https://doi.org/10.1007/BF01934993
Mendeley helps you to discover research relevant for your work.