Abstract
In this note an alternative analysis of a probabilistic counting algorithm due to Flajolet and Martin is presented. The asymptotic evaluation of certain combinatorial sums is performed via residue calculus instead of Flajolet's Mellin transform approach that had to use some unpleasant real analysis.
The second author wants to thank M. Drmota for his advice and patience concerning TEX.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Flajolet and G.N. Martin, Probabilistic Counting Algorithms for Data Base Applications, J.Comput.Syst.Sci. 31 (1985), 182–209.
P. Flajolet and R. Sedgewick, Digital Search Trees Revisited, SIAM J.Comput. 15 (1986), 748–767.
P. Kirschenhofer and H. Prodinger, Approximate Counting: An Alternative Analysis, RAIRO Informatique Théorique (1990) (to appear).
U. Schmid, Analyse von Collision-Resolution Algorithmen in Random-Access-Systemen mit dominanten Übertragungskanälen, Dissertation TU Wien (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Kirschenhofer, P., Prodinger, H. (1990). On the analysis of probabilistic counting. In: Hlawka, E., Tichy, R.F. (eds) Number-Theoretic Analysis. Lecture Notes in Mathematics, vol 1452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0096984
Download citation
DOI: https://doi.org/10.1007/BFb0096984
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53408-2
Online ISBN: 978-3-540-46864-6
eBook Packages: Springer Book Archive