SOME AVERAGE MEASURES IN M-ARY SEARCH-TREES

被引：11
|
作者：
BAEZAYATES, RA [1 ]
机构：
[1] UNIV CHILE,DEPT COMP SCI,SANTIAGO,CHILE
来源：
INFORMATION PROCESSING LETTERS | 1987年 / 25卷 / 06期
关键词：
D O I：
10.1016/0020-0190(87)90215-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：375 / 381
页数：7
相关论文
共 50 条
  • [1] ON THE AVERAGE INTERNAL PATH-LENGTH OF M-ARY SEARCH-TREES
    MAHMOUD, HM
    [J]. ACTA INFORMATICA, 1986, 23 (01) : 111 - 117
  • [2] NOTE ON THE HEIGHTS OF RANDOM RECURSIVE TREES AND RANDOM M-ARY SEARCH-TREES
    PITTEL, B
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (02) : 337 - 347
  • [3] On the Average Path Length of Complete m-ary Trees
    Nyblom, M. A.
    [J]. JOURNAL OF INTEGER SEQUENCES, 2014, 17 (06)
  • [4] Balancing m-ary search trees with compressions on the fringe
    Gao, Shuyang
    Hatem, Leen
    Mahmoud, Hosam
    [J]. ACTA INFORMATICA, 2024, 61 (01) : 53 - 66
  • [5] Balancing m-ary search trees with compressions on the fringe
    Shuyang Gao
    Leen Hatem
    Hosam Mahmoud
    [J]. Acta Informatica, 2024, 61 : 53 - 66
  • [6] Distribution of the Steiner distance in generalized M-ary search trees
    Panholzer, A
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2004, 13 (4-5): : 717 - 733
  • [7] Dependence and phase changes in random m-ary search trees
    Chern, Hua-Huai
    Fuchs, Michael
    Hwang, Hsien-Kuei
    Neininger, Ralph
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2017, 50 (03) : 353 - 379
  • [8] Phase changes in random m-ary search trees and generalized quicksort
    Chern, HH
    Hwang, HK
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2001, 19 (3-4) : 316 - 358
  • [9] Limit distributions for multitype branching processes of m-ary search trees
    Chauvin, Brigitte
    Liu, Quansheng
    Pouyanne, Nicolas
    [J]. ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2014, 50 (02): : 628 - 654
  • [10] Transfer theorems and asymptotic distributional results for m-ary search trees
    Fill, JA
    Kapur, N
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2005, 26 (04) : 359 - 391
12345