Approximate counting : an alternative approach

DOI10.1051/ita/1991250100431zbMath0732.68052OpenAlexW83999768MaRDI QIDQ3358234

Prodinger, Helmut, Peter Kirschenhofer

Publication date: 1991

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92380

zbMATH Keywords

probabilistic algorithmapproximate countingMellin integral transform

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15)

Related Items (8)

Approximate counting with \(m\) counters: a probabilistic analysis ⋮ Consecutive records in geometrically distributed words ⋮ Approximate counting with \(m\) counters: A detailed analysis ⋮ Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet ⋮ Generalized approximate counting revisited ⋮ How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate counting: a detailed analysis
• Digital Search Trees Revisited
• Counting large numbers of events in small registers

This page was built for publication: Approximate counting : an alternative approach