PARALLEL PROCESSING OF COMBINATORIAL SEARCH-TREES

被引：0

|

作者：

MONIEN, B

VORNBERGER, O

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1987年 / 269卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：60 / 69

页数：10

相关论文

共 50 条

[31] 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
[32] ELIMINATING THE FLAG IN THREADED BINARY SEARCH-TREES
GORDON, D
INFORMATION PROCESSING LETTERS, 1986, 23 (04) : 209 - 214
[33] OPTIMAL MULTI-WAY SEARCH-TREES
GOTLIEB, L
SIAM JOURNAL ON COMPUTING, 1981, 10 (03) : 422 - 433
[34] SELF-ADJUSTING AUGMENTED SEARCH-TREES
LAI, TW
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 88 - 96
[35] GROWING NEARLY OPTIMAL BINARY SEARCH-TREES
KORSH, JF
INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 139 - 143
[36] GREEDY BINARY SEARCH-TREES ARE NEARLY OPTIMAL
KORSH, JF
INFORMATION PROCESSING LETTERS, 1981, 13 (01) : 16 - 19
[37] A SIMPLE AND POWERFUL REPRESENTATION OF BINARY SEARCH-TREES
ZHENG, SQ
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 507 : 192 - 198
[38] SELF-ADJUSTING BINARY SEARCH-TREES
SLEATOR, DD
TARJAN, RE
JOURNAL OF THE ACM, 1985, 32 (03) : 652 - 686
[39] SELF-ADJUSTING MULTIWAY SEARCH-TREES
MARTEL, C
INFORMATION PROCESSING LETTERS, 1991, 38 (03) : 135 - 141
[40] THE ANALYSIS OF A FRINGE HEURISTIC FOR BINARY SEARCH-TREES
POBLETE, PV
MUNRO, JI
JOURNAL OF ALGORITHMS, 1985, 6 (03) : 336 - 350

← 1 2 3 4 5 →