A SUBQUADRATIC ALGORITHM FOR CONSTRUCTING APPROXIMATELY OPTIMAL BINARY SEARCH-TREES

被引：10

作者：

LARMORE, LL

机构：

[1] CALIF STATE UNIV DOMINGUEZ HILLS, CARSON, CA 90747 USA

[2] UNIV CALIF IRVINE, IRVINE, CA 92717 USA

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1987年 / 8卷 / 04期

关键词：

D O I：

10.1016/0196-6774(87)90052-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：579 / 591

页数：13

共 50 条

[1] Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
Karpinski, M
Larmore, LL
Rytter, W
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 36 - 41
[2] OPTIMAL BINARY SEARCH-TREES
DOBOSIEWICZ, W
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 19 (02) : 135 - 151
[3] GREEDY BINARY SEARCH-TREES ARE NEARLY OPTIMAL
KORSH, JF
INFORMATION PROCESSING LETTERS, 1981, 13 (01) : 16 - 19
[4] GROWING NEARLY OPTIMAL BINARY SEARCH-TREES
KORSH, JF
INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 139 - 143
[5] BINARY SEARCH-TREES OF ALMOST OPTIMAL HEIGHT
ANDERSSON, A
ICKING, C
KLEIN, R
OTTMANN, T
ACTA INFORMATICA, 1990, 28 (02) : 165 - 178
[6] ON THE COSTS OF OPTIMAL AND NEAR-OPTIMAL BINARY SEARCH-TREES
ALLEN, B
ACTA INFORMATICA, 1982, 18 (03) : 255 - 263
[7] ON BINARY SEARCH-TREES
DEPRISCO, R
DESANTIS, A
INFORMATION PROCESSING LETTERS, 1993, 45 (05) : 249 - 253
[8] A METHOD FOR CONSTRUCTING BINARY SEARCH-TREES BY MAKING INSERTIONS AT THE ROOT
STEPHENSON, CJ
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1980, 9 (01): : 15 - 29
[9] A NEW CLASS OF BALANCED SEARCH-TREES - HALF-BALANCED BINARY SEARCH-TREES
OLIVIE, HJ
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1982, 16 (01): : 51 - 71
[10] BINARY SEARCH-TREES WITH BINARY COMPARISON COST
OTTMANN, T
ROSENBERG, AL
SIX, HW
WOOD, D
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1984, 13 (02): : 77 - 101

← 1 2 3 4 5 →