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 条

[21] THE ANALYSIS OF A FRINGE HEURISTIC FOR BINARY SEARCH-TREES
POBLETE, PV
MUNRO, JI
JOURNAL OF ALGORITHMS, 1985, 6 (03) : 336 - 350
[22] ON THE VARIANCE OF THE HEIGHT OF RANDOM BINARY SEARCH-TREES
DEVROYE, L
REED, B
SIAM JOURNAL ON COMPUTING, 1995, 24 (06) : 1157 - 1162
[23] Assembling approximately optimal binary search trees efficiently using arithmetics
Kujala, Jussi
INFORMATION PROCESSING LETTERS, 2009, 109 (16) : 962 - 966
[24] OPTIMAL MULTI-WAY SEARCH-TREES
GOTLIEB, L
SIAM JOURNAL ON COMPUTING, 1981, 10 (03) : 422 - 433
[25] THE USE OF BINARY SEARCH-TREES IN EXTERNAL DISTRIBUTION SORTING
COOPER, D
LYNCH, MF
INFORMATION PROCESSING & MANAGEMENT, 1984, 20 (04) : 547 - 557
[26] THE EXPECTED DISTRIBUTION OF DEGREES IN RANDOM BINARY SEARCH-TREES
MAHMOUD, HM
COMPUTER JOURNAL, 1986, 29 (01): : 36 - 37
[27] A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees
Ruzankin P.S.
SN Computer Science, 3 (5)
[28] EXACT AND ASYMPTOTIC DISTRIBUTIONS IN DIGITAL AND BINARY SEARCH-TREES
LOUCHARD, G
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (04): : 479 - 495
[29] PARALLEL ALGORITHMS FOR BALANCING THREADED BINARY SEARCH-TREES
HAQ, E
ZHENG, SQ
EIGHTH ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS: 1989 CONFERENCE PROCEEDINGS, 1989, : 286 - 290
[30] FAULT TOLERANCE AND STORAGE REDUCTION IN BINARY SEARCH-TREES
MUNRO, JI
POBLETE, PV
INFORMATION AND CONTROL, 1984, 62 (2-3): : 210 - 218

← 1 2 3 4 5 →