Approximate counting with m counters: A detailed analysis
From MaRDI portal
Publication:441872
DOI10.1016/J.TCS.2012.03.016zbMATH Open1246.05013OpenAlexW2038091752MaRDI QIDQ441872FDOQ441872
Authors: Helmut Prodinger 
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
Recommendations
- Approximate counting with \(m\) counters: a probabilistic analysis
- Approximate counting: a detailed analysis
- scientific article; zbMATH DE number 1670534
- On the parameterized complexity of approximate counting
- The relative complexity of approximate counting problems
- Generalized approximate counting revisited
- scientific article; zbMATH DE number 7701429
- scientific article; zbMATH DE number 549850
- Approximate counting and NP search problems
- scientific article; zbMATH DE number 1979521
Cites Work
- Title not available (Why is that?)
- Asymptotics of the moments of extreme-value related distribution functions
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- 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
- Periodic oscillations in the analysis of algorithms and their cancellations
- Approximate counting : an alternative approach
- Asymptotic variance of random symmetric digital search trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Digital Search Trees Again Revisited: The Internal Path Length Perspective
Cited In (11)
- Title not available (Why is that?)
- Efficient deterministic approximate counting for low-degree polynomial threshold functions
- Title not available (Why is that?)
- Approximate counting with \(m\) counters: a probabilistic analysis
- Approximate counting with a floating-point counter
- Approximate shared-memory counting despite a strong adversary
- Approximate counting: a detailed analysis
- Approximate counting:a martingale approach
- Approximate Counting with Deterministic Guarantees for Affinity Computation
- Generalized approximate counting revisited
- Approximate counting via the Poisson-Laplace-Mellin method
This page was built for publication: Approximate counting with \(m\) counters: A detailed analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q441872)
