Approximate counting with \(m\) counters: A detailed analysis
From MaRDI portal
Publication:441872
DOI10.1016/j.tcs.2012.03.016zbMath1246.05013OpenAlexW2038091752MaRDI QIDQ441872
Publication date: 8 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.016
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- 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 Again Revisited: The Internal Path Length Perspective
This page was built for publication: Approximate counting with \(m\) counters: A detailed analysis