Approximate Counting via the Poisson-Laplace-Mellin Method

Approximate Counting via the Poisson-Laplace-Mellin Method

Approximate counting is an algorithm that provides a count of a huge number of objects within an error tolerance. The first detailed analysis of this algorithm was given by Flajolet. In this paper, we propose a new analysis via the Poisson-Laplace-Mellin approach, a method devised for analyzing shap...

Full description

Bibliographic Details
Main Authors: Michael Fuchs, Chung-Kuei Lee, Helmut Prodinger
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2012-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
approximate counting
digital search tree
js-admissibility
laplace transform
mellin transform
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-cg] computer science [cs]/computational geometry [cs.cg]
Online Access:https://dmtcs.episciences.org/2980/pdf

Internet

https://dmtcs.episciences.org/2980/pdf

Similar Items