Skip to Main content Skip to Navigation
Conference papers

Approximate Counting via the Poisson-Laplace-Mellin Method

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.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-01197238
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, September 11, 2015 - 12:55:00 PM
Last modification on : Tuesday, March 7, 2017 - 3:18:32 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 12:35:03 AM

File

dmAQ0102.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01197238, version 1

Collections

Citation

Michael Fuchs, Chung-Kuei Lee, Helmut Prodinger. Approximate Counting via the Poisson-Laplace-Mellin Method. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.13-28. ⟨hal-01197238⟩

Share

Metrics

Record views

280

Files downloads

751