BALANCING BINARY-TREES BY INTERNAL PATH REDUCTION

被引：11
|
作者：
GONNET, GH
机构：
来源：
COMMUNICATIONS OF THE ACM | 1983年 / 26卷 / 12期
关键词：
D O I：
10.1145/358476.358509
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：1074 / 1081
页数：8
相关论文
共 50 条
  • [1] PAGING BINARY-TREES WITH EXTERNAL BALANCING
    HENRICH, A
    SIX, HW
    WIDMAYER, P
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 411 : 260 - 276
  • [2] ON THE PATH-LENGTH OF BINARY-TREES
    KLEIN, R
    WOOD, D
    [J]. JOURNAL OF THE ACM, 1989, 36 (02) : 280 - 289
  • [3] THE PATH-LENGTH OF BINARY-TREES
    KLEIN, R
    WOOD, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 367 : 128 - 136
  • [4] DERIVATION OF A PARALLEL ALGORITHM FOR BALANCING BINARY-TREES
    MOITRA, A
    IYENGAR, SS
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1986, 12 (03) : 442 - 449
  • [5] MAXIMAL PATH-LENGTH OF BINARY-TREES
    CAMERON, H
    WOOD, D
    [J]. DISCRETE APPLIED MATHEMATICS, 1994, 55 (01) : 15 - 35
  • [6] A SHORTEST-PATH METRIC ON UNLABELED BINARY-TREES
    BONNIN, A
    PALLO, JM
    [J]. PATTERN RECOGNITION LETTERS, 1992, 13 (06) : 411 - 415
  • [7] TIGHT BOUNDS ON THE PATH-LENGTH OF BINARY-TREES
    DESANTIS, A
    PERSIANO, G
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 480 : 478 - 487
  • [8] ON RANDOM BINARY-TREES
    BROWN, GG
    SHUBERT, BO
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1984, 9 (01) : 43 - 65
  • [9] BINARY-TREES AND PERMUTATIONS
    HILLE, RF
    [J]. AUSTRALIAN COMPUTER JOURNAL, 1985, 17 (02): : 85 - 87
  • [10] BINARY-TREES, FRINGE THICKNESS AND MINIMUM PATH-LENGTH
    CAMERON, H
    WOOD, D
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1995, 29 (03): : 171 - 191
12345