On the distribution of binary search trees under the random permutation model

Random Structures and Algorithms

Volumn 8, Issue 1, 1996, Pages 1-25

  Fill, James Allen ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030304083     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199601)8:1<1::AID-RSA1>3.0.CO;2-1     Document Type: Article

References (3)

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. H. M. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.