Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet
From MaRDI portal
Publication:1193635
DOI10.1016/0304-3975(92)90371-LzbMath0747.68032MaRDI QIDQ1193635
Publication date: 27 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)
Related Items (7)
Approximate counting with \(m\) counters: a probabilistic analysis ⋮ Rounding of continuous random variables and oscillatory asymptotics ⋮ Consecutive records in geometrically distributed words ⋮ Approximate counting with \(m\) counters: A detailed analysis ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ Mellin transforms and asymptotics: Finite differences and Rice's integrals ⋮ Unnamed Item
Cites Work
This page was built for publication: Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet
