Approximate counting with \(m\) counters: a probabilistic analysis

zbMath1344.60013MaRDI QIDQ307930

Guy Louchard, Prodinger, Helmut

Publication date: 5 September 2016

Published in: Journal of Algebra, Combinatorics, Discrete Structures and Applications (Search for Journal in Brave)

zbMATH Keywords

momentscomplex analysisapproximate countingconstant and fluctuating componentsproduct of Fourier series

Mathematics Subject Classification ID

Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Cites Work

• Approximate counting with \(m\) counters: A detailed analysis
• Asymptotics of the moments of extreme-value related distribution functions
• Approximate counting: a detailed analysis
• Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet
• Generalized approximate counting revisited
• Approximate counting : an alternative approach
• Asymptotic variance of random symmetric digital search trees
• Digital Search Trees Revisited
• Exact and asymptotic distributions in digital and binary search trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate counting with \(m\) counters: a probabilistic analysis