Approximate counting with m counters: A detailed analysis

Authors:
Helmut Prodinger
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2012

Citing 7
Cited 0

Approximate counting: a detailed analysis

BIT - Ellis Horwood series in artificial intelligence
Hypothetical analyses: approximate counting in the style of Knuth, path length in the style of Flajolet

Theoretical Computer Science
Digital Search Trees Again Revisited: The Internal Path Length Perspective

SIAM Journal on Computing
Mellin transforms and asymptotics: finite differences and Rice's integrals

Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Asymptotics of the Moments of Extreme-Value Related Distribution Functions

Algorithmica
Generalized approximate counting revisited

Theoretical Computer Science
Approximate Counters for Flash Memory

RTCSA '11 Proceedings of the 2011 IEEE17th International Conference on Embedded and Real-Time Computing Systems and Applications - Volume 01

Quantified Score

Hi-index	5.23

Visualization

Abstract

The classical algorithm approximate counting has been recently modified by Cichon and Macyna: instead of one counter, m counters are used, and the assignment of an incoming item to one of the counters is random. The parameter of interest is the sum of the values of all the counters. We analyse expectation and variance, getting explicit and asymptotic formulae.