Singularity analysis and asymptotics of Bernoulli sums

Theoretical Computer Science

Volumn 215, Issue 1-2, 1999, Pages 371-381

  Flajolet, Philippe ^a  

^a INRIA   (France)

Author keywords

Analysis of algorithms; Analytic information theory; Bernoulli variables; Entropy estimation; Singularity analysis

Indexed keywords

EID: 0007554179     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00220-5     Document Type: Article

References (15)

1. G. Doetsch, Handbuch der Laplace Transformation, vol. 1-3, Birkhäuser Verlag, Basel, 1955.
2. J.A. Fill, On the distribution of binary search trees under the random permutation model, Random Struc. Algorithms 8 (1996) (1) 1-25.
3. P. Flajolet, X. Gourdon, P. Dumas, Mellin transforms and asymptotics: harmonic sums, Theoret. Compu. Sci. 144 (1995) (1-2) 3-58.
4. P. Flajolet, A.M. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math. 3 (1990) (2) 216-240.
5. W.B. Ford, Studies on Divergent Series and Summability and the Asymptotic Developments of Functions Defined by Maclaurin Series, 3rd ed., Chelsea Publishing Company, New York, 1960.
6. P. Jacquet, W. Szpankowski, Entropy computations via analytic depoissonization, Tech. Report CSD-TR-96-085, Purdue University, 1996, Revised February 1998, 22 pp.
7. P. Jacquet, W. Szpankowski, Analytical depoissonization and its applications, Theoret. Comput. Sci. (1998); In print, 67 pp.
8. C. Knessel, Integral representations and asymptotic expansions for Shannon and Renyi entropies, Appl. Mathe. Lett. 11 (1998) (2) 69-74.
9. D.E. Knuth, B. Pittel, A recurrence related to trees, Proc. Amer. Math. Soc. 105 (1989) (2) 335-349.
10. R.E. Krichevskiy, Laplace's law of succession and universal encoding, IEEE Trans. Inform. Theory 44 (1998) (1) 296-303.
11. L. Lewin (Ed.), Structural Properties of Polylogarithms, American Mathematical Society, Providence, RI, 1991.
12. E. Lindelöf, Collection de monographies sur la théorie des fonctions, publiée sous la direction de M. Émile Borel, Gauthier-Villars, Paris, 1905, Reprinted by Gabay, Paris, 1989.
13. A. Meir, J.W. Moon, On the log-product of subtree-sizes in random trees, Random Struc. Algorithms 12 (1998) (2) 197-212.
14. A.M. Odlyzko, Asymptotic enumeration methods, in: R. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics (Amsterdam), vol. II, Elsevier, Amsterdam, 1995, pp. 1063-1229.
15. R. Wong, Asymptotic Approximations of Integrals, Academic Press, New York, 1989.