1. Approximate Counting via the Poisson-Laplace-Mellin Method
- Author
-
Michael Fuchs, Chung-Kuei Lee, and Helmut Prodinger
- 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] ,Mathematics ,QA1-939 - Abstract
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 shape parameters of digital search trees in a recent paper of Hwang et al. Our approach yields a different and more compact expression for the periodic function from the asymptotic expansion of the variance. We show directly that our expression coincides with the one obtained by Flajolet. Moreover, we apply our method to variations of approximate counting, too.
- Published
- 2012
- Full Text
- View/download PDF