A Unified Approach to the Analysis of Horton-Strahler Parameters of Binary Tree Structures

Random Structures and Algorithms

Volumn 21, Issue 3-4, 2002, Pages 252-277

  Nebel, Markus E ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Analytic combinatorics; Average case analysis; Combinatorial structures; Horton Strahler numbers

Indexed keywords

EID: 0036437266     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10052     Document Type: Conference Paper

References (35)

1. M. Abramowitz and I. A. Stegun, Handbook of mathematical functions, Dover, New York, 1970.
2. D. J. Aldous, The continuum random tree II: An overview, Stochastic Analysis (Durham, 1990), London Math Soc Lecture Note Ser 167, Cambridge Univ Press, Cambridge, 1991, pp. 23-70.
3. E. A. Bender and L. B. Richmond, Central and local limit theorems applied to asymptotic enumeration II: Multivariate generating functions, J Combinat Theory Ser A 34 (1983), 255-265.
4. N. G. de Bruijn, D. E. Knuth, and S. O. Rice, The average height of planted plane trees, Graph Theory and Computing (R. C. Read, Ed.), Academic Press, New York, 1972.
5. L. Comtet, Advanced combinatorics, D. Reidel, Dordrecht, 1974.
6. L. Devroye and P. Kruszewski, On the Horton-Strahler number for random tries, Theoret Inf Appl 30 (1996), 443-456.
7. A. P. Ershov, On programming of arithmetic operations, Commun ACM 1 (1958), 3-6.
8. P. Flajolet, J. C. Raoult, and J. Vuillemin, The number of registers required for evaluating arithmetic expressions, Theoret Comput Sci 9 (1979), 99-125.
9. P. Flajolet, Analyse d'algorithmes de manipulation d'arbres et de fichier, Cah BURO 34-35 (1981), 1-209.
10. P. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM J Discrete Math 3(2) (1990), 216-240.
11. P. Flajolet and H. Prodinger, Register allocation for unary-binary trees, SIAM J Comput 15 (1986), 629-640.
12. P. Flajolet and R. Sedgewick, The average case analysis of algorithms: Multivariate asymptotics and limit distributions, INRIA Rapport de Recherche 3162, Rocquencourt, 1997.
13. P. Flajolet and M. Soria, General combinatorial schemas: Gaussian limit distributions and exponential tails, Discrete Math 114 (1993), 159-180.
14. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoret Comput Sci 144 (1995), 3-58.
15. J. Françon, Sur le nombre de registres nécessaires á l'évaluation d'une expression arithmétique, RAIRO Theoret Info Appl 18 (1984), 355-364.
16. I. Herman, M. Delest, and G. Melançon, Tree visualisation and navigation clues for information visualisation, Comput Graphics Forum 17 (1998), 153-165.
17. R. E. Horton, Erosioned development of streams and their drainage basins, hydrophysical approach to quantitative morphology, Bull Geol Soc Am 56 (1945), 275-370.
18. R. Kemp, The average number of registers needed to evaluate a binary tree optimally, Acta Inf 11 (1979), 363-372.
19. R. Kemp, Fundamentals of the average case analysis of particular algorithms, Wiley-Teubner Series in Computer Science, Wiley, New York, 1984.
20. D. E. Knuth, The art of computer programming, Vol. 3, Sorting and searching, Addison Wesley, Reading, MA, 1998.
21. V. F. Kolchin, Random mappings, Optimization Software, New York, 1986. (translation of Russian original).
22. A. Meir and J. W. Moon, On the altitude of nodes in random trees, Can J Math 30 (1978), 997-1015.
23. A. Meir and J. W. Moon, Stream lengths in random channel networks, Cong Numer 33 (1980), 25-33.
24. A. Meir, J. W. Moon, and J. R. Pounder, On the order of random channel networks, SIAM J Alg Discrete Math 1 (1980), 25-33.
25. M. E. Nebel, The stack-size of tries, a combinatorial study, Theoret Comput Sci 270 (2002), 441-461.
26. M. E. Nebel, On the Horton-Strahler number for combinatorial tries, RAIRO Theoret Inf Appl 34 (2000), 279-296.
27. M. E. Nebel, The stack-size of combinatorial tries revisited, Discrete Math Theoret Comput Sci 5 (2002), 1-16.
28. M. E. Nebel, Combinatorial properties of RNA secondary structures, J Comput Biol 3 (2002), 541-574.
29. H. Prodinger, Die Bestimmung gewisser Parameter von binären Bäumen mit Hilfe analytischer Methoden, Zahlentheoretische Analysis, Lecture Notes in Mathematics 1114, Springer-Verlag, Berlin, 1985, pp. 118-133.
30. H. Prodinger, Some recent results on the register function of a binary tree, Ann Discrete Math 33 (1987), 241-260.
31. A. N. Strahler, Hypsometric (area-altitude) analysis of erosonal topology, Bull Geol Soc Am 63 (1952), 1117-1142.
32. M. S. Waterman, Secondary structure of single-stranded nucleic acids, Adv Math Suppl Stud 1 (1978), 167-212.
33. M. Vauchaussade de Chaumont, Nombre de Strahler des arbres, langages algébriques et dénombrement de structures secondaires en biologie moléculaire, Thése 3'eme cycle, Université de Bordeaux I, May 1985.
34. X. G. Viennot, G. Eyrolles, N. Janey, and D. Arques, Combinatorial analysis of ramified patternas and computer imagery of trees, Proc SIGGRAPH'89, Computer Graphics 23, 1989, pp. 31-40.
35. X. G. Viennot, Trees everywhere, Proc CAAP'90 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, LNCS 431, Springer-Verlag, Berlin, Heidelberg, New York, 1990, pp. 18-41.