Generalized approximate counting revisited

DOI10.1016/j.tcs.2007.10.035zbMath1133.60302OpenAlexW2073555912MaRDI QIDQ2474230

Prodinger, Helmut, Guy Louchard

Publication date: 5 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.035

zbMATH Keywords

Markov chaintransition probabilityapproximate counting\(q\)-analysis\(q\)-distribution

Mathematics Subject Classification ID

Combinatorial probability (60C05) Theory of computing (68Q99)

Related Items (5)

Approximate counting with \(m\) counters: a probabilistic analysis ⋮ Philippe Flajolet's early work in combinatorics ⋮ Consecutive records in geometrically distributed words ⋮ Approximate counting with \(m\) counters: A detailed analysis ⋮ Geometric juggling with \(q\)-analogues

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotics of the moments of extreme-value related distribution functions
• Approximate counting: a detailed analysis
• \(q\)-distributions and Markov processes
• Non-central generalized \(q\)-factorial coefficients and \(q\)-Stirling numbers
• Special issue: Average-case analysis of algorithms
• Moments of a class of discrete \(q\)-distributions
• Approximate counting : an alternative approach
• Markov Processes Involving q-Stirling Numbers

This page was built for publication: Generalized approximate counting revisited