Descendants in increasing trees

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-14

  Kuba, Markus ^a   Panholzer, Alois ^a  

^a INSTITUT FÜR DISKRETE MATHEMATIK UND GEOMETRIE   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31544479516     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1034     Document Type: Article

References (11)

1. F. Bergeron, P. Flajolet and B. Salvy, Varieties of Increasing Trees, Lecture Notes in Computer Science 581, 24-48, 1992.
2. J. L. Gastwirth and P. K. Bhattacharya, Two probability models of pyramid or chain letter schemes demonstrating that their promotional claims are unreliable, Operations Research 32, 527-536, 1984.
3. M. Kuba and A. Panholzer, Isolating a leaf in rooted trees via random cuttings, submitted, 2005. available at http://info.tuwien.ac.at/panholzer/ cuttingleaves8.pdf
4. M. Loève, Probability Theory I, 4th Edition, Springer-Verlag, New York, 1977.
5. H. Mahmoud and R. Smythe, On the distribution of leaves in rooted subtrees of recursive trees, Annals of Applied Probability 1, 406-418, 1991.
6. H. Mahmoud and R. Smythe, A Survey of Recursive Trees, Theoretical Probability and Mathematical Statistics 51, 1-37, 1995.
7. A. Meir and J. W. Moon, On the altitude of nodes in random trees, Canadian Journal of Mathematics 30, 997-1015, 1978.
8. D. Najock and C. C. Heyde, On the number of terminal vertices in certain random trees with an application to stemma construction in philology, Journal of Applied Probability 19, 675-680, 1982.
9. A. Panholzer and H. Prodinger, The level of nodes in increasing trees revisited, Random Structures & Algorithms, accepted for publication, 2005. available at http://info.tuwien.ac.at/panholzer/levelincrev.pdf
10. H. Prodinger, Descendants in heap ordered trees, or, A triumph of computer algebra, Electronic Journal of Combinatorics 3, paper #29, 1996.
11. J. Vitter and P. Flajolet, Average Case Analysis of Algorithms and Data Structures, in Handbook of Theoretical Computer Science, 431-524, Elsevier, Amsterdam, 1990.