Approximate Counting via the Poisson-Laplace-Mellin Method - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

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 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.
Fichier principal
Vignette du fichier
dmAQ0102.pdf (332.57 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01197238 , version 1 (11-09-2015)



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, ⟨10.46298/dmtcs.2980⟩. ⟨hal-01197238⟩


105 View
524 Download



Gmail Facebook Twitter LinkedIn More