Louchard, Guy; Prodinger, Helmut Advancing in the presence of a demon. (English) Zbl 1174.05008 Math. Slovaca 58, No. 3, 263-276 (2008). Summary: We study a parameter that contains approximate counting, i.e., the level reached after \(n\) random increments, driven by geometric probabilities, and insertion costs for tries as special cases. We are able to compute all moments of this parameter in a semi-automatic fashion. This is another showcase of the machinery developed in an earlier paper of these authors. Roughly speaking, it works when the underlying distributions are distributed according to the Gumbel distribution, or something similar. Cited in 1 ReviewCited in 2 Documents MSC: 05A16 Asymptotic enumeration 68P05 Data structures 68R05 Combinatorics in computer science Keywords:Gumbel distribution; approximate counting; demon; trie; search cost; moment PDFBibTeX XMLCite \textit{G. Louchard} and \textit{H. Prodinger}, Math. Slovaca 58, No. 3, 263--276 (2008; Zbl 1174.05008) Full Text: DOI References: This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.