On the average internal path length of m-ary search trees-Reference-Cited by-同舟云学术

On the average internal path length of m-ary search trees

Published:1986-04 Issue:1 Volume:23 Page:111-117
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Mahmoud Hosam M.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00268078.pdf

Reference8 articles.

1. Horowitz, E., Sahni, S.: Fundamentals of Data Structures. Potomac: Computer Science Press 1976

2. Knuth, D.E.: The Art of Computer Programming, Vol. 3. Reading: Addison-Wesley 1973

3. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures. Potomac: Computer Science Press 1983

4. Comer, D.: The Ubiquitous B-tree, Comput. Surv., 11, 121–137 (1979)

5. Mahmoud, H., Pittel, B.: On the Joint Distribution of the Path Length and the Number of Comparisons in a Random Search Tree. Discrete Math. (Submitted)

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

1. The fluctuations of the giant cluster for percolation on random split trees;Latin American Journal of Probability and Mathematical Statistics;2022

2. Dependence and phase changes in randomm-ary search trees;Random Structures & Algorithms;2016-08-30

3. A weakly 1-stable distribution for the number of random records and cuttings in split trees;Advances in Applied Probability;2011-03

4. A weakly 1-stable distribution for the number of random records and cuttings in split trees;Advances in Applied Probability;2011-03

5. On the Asymptotic Internal Path Length and the Asymptotic Wiener Index of Random Split Trees;Electronic Journal of Probability;2011-01-01