Singularity analysis, Hadamard products, and tree recurrences

Journal of Computational and Applied Mathematics

Volumn 174, Issue 2, 2005, Pages 271-313

  Fill, James Allen ^a   Flajolet, Philippe ^b   Kapur, Nevin ^c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b INRIA ROCQUENCOURT   (France)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Asymptotic expansions; Contour integration; Divide and conquer; Generalized polylogarithm; Generating functions; Hadamard products; Moment pumping; Shape functional; Singularity analysis; Tree recurrences

Indexed keywords

ALGORITHMS; DIFFERENTIATION (CALCULUS); INTEGRATION; MATHEMATICAL MODELS; TREES (MATHEMATICS);

ASYMPTOTIC EXPANSIONS; CONTOUR INTEGRATION; DIVIDE-AND-CONQUER ALGORITHM; GENERALIZED POLYLOGARITHM; GENERATING FUNCTIONS; HADAMARD PRODUCTS; MOMENT PUMPING; SHAPE FUNCTIONAL; SINGULARITY ANALYSIS; TREE RECURRENCES;

COMBINATORIAL MATHEMATICS;

EID: 11044235781     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2004.04.014     Document Type: Article

References (63)

1. M. Abramowitz I.A. Stegun Handbook of Mathematical Functions 1973 Dover New York (a reprint of the tenth National Bureau of Standards edition, 1964)
2. F. Bergeron, P. Flajolet, B. Salvy, Varieties of increasing trees, in: J.-C. Raoult (Ed.), CAAP'92, Lecture Notes in Computer Science, Vol. 581, Proceedings of the 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 1992, pp. 24-48.
3. B.C. Berndt Ramanujan's Notebooks, Part I 1985 Springer Berlin
4. L. Bieberbach Lehrbuch der Funktionen Theorie, Two vols. 1931 Teubner Leipzig (Reprinted by Johnson, New York, 1968)
5. M. Bousquet-Mélou A.J. Guttmann Three-dimensional self-avoiding convex polygons Phys. Rev. E Statist. Phys. Plasmas Fluids Related Interdisciplinary Topics Third Ser. 55 6 (part A) 1997 R6323-R6326
6. H.-H. Chern H.-K. Hwang Phase changes in random m-ary search trees and generalized quicksort Random Struct. Algorithms 19 3-4 2001 316-358
7. H.-H. Chern H.-K. Hwang T.-H. Tsai An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms J. Algorithms 44 1 2002 177-225 analysis of algorithms
8. F. Chyzak Staircase polygons, a simplified model for self-avoiding walks Stud. Automat. Combin. I 1997 26 published electronically by Algorithms Project, INRIA
9. R.M. Corless G.H. Gonnet D.E.G. Hare D.J. Jeffrey D.E. Knuth On the Lambert W function Adv. Comput. Math. 5 1996 329-359
10. T.H. Cormen C.E. Leiserson R.L. Rivest Introduction to Algorithms 1990 MIT Press New York
11. T.M. Cover J.A. Thomas Elements of Information Theory 1991 Wiley New York (a Wiley-Interscience publication)
12. D.S. Dean S.N. Majumdar Phase transition in a random fragmentation problem with applications to computer science J. Phys. A Math. Gen. 35 2002 L501-L507
13. G. Derfel, F. Vogl, Asymptotic analysis of binomial recurrences, in: Topics in Functional Differential and Difference Equations (Lisbon, 1999), Fields Inst. Commun., Vol. 29, American Mathematical Society, Providence, RI, 2001, pp. 93-104.
14. P. Dienes The Taylor Series 1958 Dover New York (a reprint of the first Oxford University Press edition, 1931)
15. P.G. Doyle J.L. Snell Random Walks and Electric Networks 1984 Mathematical Association of America Washington, DC
16. J.A. Fill On the distribution of binary search trees under the random permutation model Random Struct. Algorithms 8 1 1996 1-25
17. J.A. Fill, N. Kapur, An invariance principle for simply generated families of trees, Technical Report, Department of Mathematical Sciences, The Johns Hopkins University, 2003.
18. J.A. Fill, N. Kapur, Limiting distributions of additive functionals on Catalan trees, Theor. Comput. Sci. (2004), to appear.
19. J.A. Fill, N. Kapur, Transfer theorems and asymptotic distributional results for m-ary search trees, 2003, submitted for publication, arXiv:mAth.PR/0306050.
20. S. Finch Mathematical Constants, Encyclopedia of Mathematics and its Applications, Vol. 94 2003 Cambridge University Press Cambridge
21. P. Flajolet Singularity analysis and asymptotics of Bernoulli sums Theoret. Comput. Sci. 215 1-2 1999 371-381
22. P. Flajolet M. Golin Mellin transforms and asymptotics: The mergesort recurrence Acta Inform. 31 1994 673-696
23. P. Flajolet G. Gonnet C. Puech J.M. Robson Analytic variations on quadtrees Algorithmica 10 7 1993 473-500
24. P. Flajolet A.M. Odlyzko Singularity analysis of generating functions SIAM J. Algebraic Discrete Methods 3 2 1990 216-240
25. P. Flajolet P. Poblete A. Viola On the analysis of linear probing hashing Algorithmica 22 4 1998 490-515
26. P. Flajolet C. Puech Partial match retrieval of multidimensional data J. ACM 33 2 1986 371-407
27. P. Flajolet B. Richmond Generalized digital trees and their difference - differential equations Random Struct. Algorithms 3 3 1992 305-320
28. P. Flajolet J.-M. Steyaert A complexity calculus for recursive tree algorithms Math. Systems Theory 19 1987 301-331
29. M.L. Glasser A Watson sum for a cubic lattice J. Math. Phys. 13 1972 1145-1146
30. I.P. Goulden D.M. Jackson Combinatorial Enumeration 1983 Wiley New York
31. D.H. Greene D.E. Knuth Mathematics for the Analysis of Algorithms 2nd Edition 1982 Birkhauser Boston
32. A.J. Guttmann T. Prellberg Staircase polygons, elliptic integrals, heun functions, and lattice green functions Phys. Rev. E 47 4 1993 R2233-2236
33. P. Henrici Applied and Computational Complex Analysis, 3 vols. 1977 Wiley New York
34. P. Henrici Applied and Computational Complex Analysis, Vol. 2, Special Functions - Integral Transforms - Asymptotics - Continued fractions 1977 Wiley Interscience New York
35. M. Hofri Analysis of Algorithms Computational Methods and Mathematical Tools 1995 Oxford University Press Oxford
36. M. Hoshi P. Flajolet Page usage in a quadtree index BIT 32 1992 384-402
37. H.-K. Hwang R. Neininger Phase change of limit laws in the quicksort recurrence under varying toll functions SIAM J. Comput. 31 6 2002 1687-1722 electronic
38. N. Kapur, Additive functionals on random search trees, Ph.D. Thesis, Department of Mathematical Sciences, The Johns Hopkins University, April 2003.
39. D.E. Knuth, The Art of Computer Programming, 3rd Edition, Fundamental Algorithms, Vol. 1, Addison-Wesley, Reading, MA, 1997.
40. D.E. Knuth The Art of Computer Programming, 2nd Edition, Sorting and Searching, Vol. 3 1998 Addison-Wesley Reading, MA
41. D.E. Knuth Selected Papers on Analysis of Algorithms 2000 CSLI Publications Stanford, CA
42. D.E. Knuth B. Pittel A recurrence related to trees Proc. Amer. Math. Soc. 105 2 1989 335-349
43. D.E. Knuth A. Schönhage The expected linearity of a simple equivalence algorithm Theoret. Comput. Sci. 6 1978 281-315
44. G.F. Lawler Intersections of Random Walks 1991 Birkhäuser Boston, Inc. Boston, MA
45. G. Louchard The Brownian excursion: A numerical analysis Comput. Math. Appl. 10 6 1984 413-417
46. G. Louchard R. Schott M. Tolley P. Zimmermann Random walks, heat equations and distributed algorithms J. Comput. Appl. Math. 53 1994 243-274
47. H.M. Mahmoud Evolution of Random Search Trees 1992 Wiley New York
48. H.M. Mahmoud Sorting, a Distribution Theory 2000 Wiley-Interscience New York
49. A. Meir J.W. Moon On the altitude of nodes in random trees Canad. J. Math. 30 1978 997-1015
50. R. Neininger On binary search tree recursions with monomials as toll functions J. Comput. Appl. Math. 142 1 2002 185-196
51. A.M. Odlyzko Asymptotic enumeration methods in: R. Graham M. Grötschel L. Lovász Handbook of Combinatorics, Vol. II 1995 Elsevier Amsterdam 1063-1229
52. F.W.J. Olver Asymptotics and Special Functions 1974 Academic Press New York
53. B. Pittel Normal convergence problem? Two moments and a recurrence may be the clues Ann. Appl. Probab. 9 4 1999 1260-1302
54. U. Rösler L. Rüschendorf The contraction method for recursive algorithms Algorithmica 29 1/2 2001 3-33
55. S. Roura An improved master theorem for divide-and-conquer recurrences Automata Languages and Programming (Bologna, 1997) 1997 Springer Berlin 449-459
56. B. Salvy, Asymptotique automatique et fonctions génératrices, Ph.D. Thesis, École Polytechnique, 1991.
57. R. Sedgewick Algorithms 2nd Edition 1988 Addison-Wesley Reading, MA
58. R. Sedgewick P. Flajolet An Introduction to the Analysis of Algorithms 1996 Addison-Wesley Reading, MA
59. R.P. Stanley Enumerative Combinatorics, Vol. II 1998 Cambridge University Press Cambridge
60. W. Szpankowski Average-Case Analysis of Algorithms on Sequences 2001 Wiley New York
61. L. Takács On a probability problem connected with railway traffic J. Appl. Math. Stochastic Anal. 4 1 1991 1-27
62. J.S. Vitter P. Flajolet Analysis of algorithms and data structures in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Algorithms and Complexity, Vol. A 1990 North-Holland Amsterdam 431-524 Chapter 9
63. E.T. Whittaker G.N. Watson A Course of Modern Analysis 4th Edition 1927 Cambridge University Press Cambridge (reprinted 1973)