On the log-product of the subtree-sizes of random trees

Random Structures and Algorithms

Volumn 12, Issue 2, 1998, Pages 197-212

  Meir, A ^a   Moon, J W ^b  

^a YORK UNIVERSITY   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032350040     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199803)12:2<197::AID-RSA3>3.0.CO;2-S     Document Type: Article

References (14)

1. R. P. Dobrow and J. A. Fill, On the Markov chain for the move-to-root rule for binary search trees, Ann. Appl. Probab. 5, 1-19 (1995).
2. R. P. Dobrow and J. A. Fill, Rates of convergence for the move-to-root Markov chain for binary search trees, Ann. Appl. Probab. 5, 20-36 (1995).
3. J. A. Fill, On the distribution of binary search trees under the random permutation model, Random Structures Algorithms 8, 1-25 (1996).
4. E. S. Keeping, Introduction to Statistical Inference, Van Nostrand, Princeton, 1962.
5. M. Klazar, Twelve countings with rooted plane trees, European J. Combin. 18, 195-210 (1997).
6. D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, 1973, Vol. 1.
7. D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, 1973, Vol. 3.
8. A. Meir and J. W. Moon, Packing and covering constants for certain families of trees, I, J. Graph. Theory 1, 157-174 (1977).
9. A. Meir and J. W. Moon, On the altitudes of nodes in random trees, Canad. J. Math. 30, 997-1015 (1978).
10. A. Meir and J. W. Moon, Games on random trees, Congr. Numer. 44, 293-303 (1984).
11. A. Meir and J. W. Moon, Recursive trees with no nodes of out-degree one, Congr. Numer. 66, 49-62 (1988).
12. H. Prodinger and F. J. Urbanek, On monotone functions of tree structure, Discrete Appl. Math. 5, 223-239 (1983).
13. J.-M. Steyaert and P. Flajolet, Patterns and pattern-matching in trees: An analysis, Inform. and Control 58, 19-58 (1983).
14. H. Wilf, Generatingfunctionology, Academic Press, Boston, 1990.