Approximate Counting, Probabilistic Counting

Approximate counting: An alternative approach. P. Kirschenhofer and H. Prodinger, RAIRO Theoretical Informatics and Applications, 25:43-48, 1991.
Hypothetic analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet. H. Prodinger, Theoretical Computer Science, 100:243-251, 1992.
How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems. P. Kirschenhofer, H. Prodinger and W. Szpankowski, editor: W. Kuich, Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science, pages 211-222, 1992.
A coin tossing algorithm for counting large numbers of events. P. Kirschenhofer and H. Prodinger, Mathematica Slovaca, 42:531-545, 1992.
A result in order statistics related to probabilistic counting. P. Kirschenhofer and H. Prodinger, Computing, 51:15-27, 1993.
How to advance on a stairway by coin flippings. H. Prodinger, Proceedings "Applications of Fibonacci Numbers", volume 5, pages 473-479. Kluwer, 1993.
Asymptotic analysis of a class of functional equations and applications. P. Grabner, H. Prodinger and R.F. Tichy, Journal de Theorie des Nombres de Bordeaux, 5:365-381, 1993.
Approximate counting via Euler transform H. Prodinger, Mathematica Slovaka, 44:569-574, 1994.
Analysis of a splitting process arising in probabilistic counting and other related algorithms. P. Kirschenhofer, H. Prodinger and W. Szpankowski, Random Structures and Algorithms, to appear, 1996.

(Back to the Homepage)