Publisher
Springer Science and Business Media LLC
Subject
Statistics and Probability
Reference22 articles.
1. Arora, S. and Dent, W. (1969). Randomized binary search technique,Communications of the ACM,12, 77–80.
2. Chassaing, P. and Marchand, R. (2002). Cutting a random tree (and UNION-FIND algorithms) (manuscript).
3. Devroye, L. (1988). Applications of the theory of records in the study of random trees,Acta Inform.,16, 123–130.
4. Drmota, M. (2002). The random bisection problem and the distribution of the height of binary search trees (manuscript).
5. Fill, J., Mahmoud, H. and Szpankowski, W. (1996). On the distribution for the duration of a randomized leader election algorithm,Ann. Appl. Probab.,6, 1260–1283.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献