Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Approximate counting : an alternative approach

Peter Kirschenhofer, Helmut Prodinger

RAIRO-Theor. Inf. Appl., 25 1 (1991) 43-48

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1991250100431

This article has been cited by the following article(s):

Approximate counting with m counters: A detailed analysis

Helmut Prodinger
Theoretical Computer Science 439 58 (2012)
https://doi.org/10.1016/j.tcs.2012.03.016

Consecutive records in geometrically distributed words

Kamilla Oliver and Helmut Prodinger
Afrika Matematika 23 (2) 163 (2012)
https://doi.org/10.1007/s13370-011-0027-9

Generalized approximate counting revisited

Guy Louchard and Helmut Prodinger
Theoretical Computer Science 391 (1-2) 109 (2008)
https://doi.org/10.1016/j.tcs.2007.10.035

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Jacek Cichoń, Marek Klonowski, Łukasz Krzywiecki, Bartłomiej Różański and Paweł Zieliński
Lecture Notes in Computer Science, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 4627 409 (2007)
https://doi.org/10.1007/978-3-540-74208-1_30

520 (2001)
https://doi.org/10.1002/9781118032770.biblio

Applications of Fibonacci Numbers

Helmut Prodinger
Applications of Fibonacci Numbers 473 (1993)
https://doi.org/10.1007/978-94-011-2058-6_47

Hypothetical analyses: approximate counting in the style of Knuth, path length in the style of Flajolet

Helmut Prodinger
Theoretical Computer Science 100 (1) 243 (1992)
https://doi.org/10.1016/0304-3975(92)90371-L

Automata, Languages and Programming

Peter Kirschenhofer, Helmut Prodinger and Wojciech Szpankowski
Lecture Notes in Computer Science, Automata, Languages and Programming 623 211 (1992)
https://doi.org/10.1007/3-540-55719-9_75