Cutting down very simple trees

Quaestiones Mathematicae

Volumn 29, Issue 2, 2006, Pages 211-227

  Panholzer, Alois ^a  

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

Author keywords

Cutting down procedure; Limiting distribution; Simply generated trees

Indexed keywords

EID: 33745531581     PISSN: 16073606     EISSN: 1727933X     Source Type: Journal    
DOI: 10.2989/16073600609486160     Document Type: Article

References (11)

1. D. Aldous, The Continuum Random Tree II: An Overview, London Mathematical Society Lecture Note Series167(1991), 23-70.
2. F. Bergeron, P. Flajolet and B. Salvy, Varieties of Increasing Trees, Lecture Notes in Computer Science581(1992), 24-48.
3. J.A. Fill, N. Kapur and a. Panholzer, Destruction of very simple trees, Algorith-mica, to appear, 2005.
4. M. Fisz, Probability Theory and Mathematical, Statistics, John Wiley, New York, 1963.
5. P. Flajolet and A. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics3(1990), 216-240.
6. P. Flajolet and R. Sedgewick, Analytic Combinatorics, in preparation. Preliminary version available at http://algo.inria.fr/flajolet/Publications/book051001.pdf
7. S. Janson, Random cutting and records in deterministic and random trees, Random Structures &Algorithms, to appear, 2005.
8. H. Mahmoud and R. Smythe, A Survey of Recursive Trees, Theoretical Probability and Mathematical, Statistics51(1995), 1-37.
9. A. Meir and J.W. Moon, Cutting down random trees, Journal of the Australian Mathematical Society11(1970), 313-324.
10. A. Panholzer and H. Prodinger, The level of nodes in increasing trees revisited, Random Structures &Algorithms, to appear, 2005.
11. H. Wilf, Generatingfunctionology, Academic Press, Boston, 1990.