Dependence and phase changes in randomm-ary search trees-Reference-Cited by-同舟云学术

Dependence and phase changes in randomm-ary search trees

Published:2016-08-30 Issue:3 Volume:50 Page:353-379
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Chern Hua-Huai¹,Fuchs Michael²,Hwang Hsien-Kuei³,Neininger Ralph⁴

Affiliation:

1. Department of Computer Science; National Taiwan Ocean University; Keelung 202 Taiwan

2. Department of Applied Mathematics; National Chiao Tung University; Hsinchu 300 Taiwan

3. Institute of Statistical Science, Academia Sinica; Taipei 115 Taiwan

4. Institute for Mathematics; Goethe University; 60054 Frankfurt a.M. Germany

Funder

Ministry of Science and Technology Taiwan

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference34 articles.

1. Some average measures in m-ary search trees;Baeza-Yates;Inform Process Lett,1987

2. Convergence of Probability Measures

3. P. Bindjeme J. A. Fill Exact L 2 -distance from the Limit for QuickSort Key Comparisons (Extended Abstract). Coauthor: Patrick Bindjeme. Refereed article, pp. 339-348 in 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA’12)

4. The total path length of split trees;Broutin;Ann Appl Probab,2012

5. m-ary search trees when m≥27: a strong asymptotics for the space requirements;Chauvin;Random Struct Algorithms,2004

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dependence between path-length and size in random digital trees;Journal of Applied Probability;2017-11-30