PRIORITY SEARCH-TREES IN SECONDARY MEMORY - (EXTENDED ABSTRACT)

被引：0

|

作者：

ICKING, C ^{[1
]}

KLEIN, R ^{[1
]}

OTTMANN, T ^{[1
]}

机构：

[1] UNIV FREIBURG,INST INFORMAT,RHEINSTR 10-12,D-7800 FREIBURG,FED REP GER

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 314卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：84 / 93

页数：10

相关论文

共 50 条

[31] A UNIFIED APPROACH TO THE PARALLEL CONSTRUCTION OF SEARCH-TREES
DAS, SK
MIN, KB
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 27 (01) : 71 - 78
[32] 2 NEW KINDS OF BIASED SEARCH-TREES
FEIGENBAUM, J
TARJAN, RE
BELL SYSTEM TECHNICAL JOURNAL, 1983, 62 (10): : 3139 - 3158
[33] 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
[34] ELIMINATING THE FLAG IN THREADED BINARY SEARCH-TREES
GORDON, D
INFORMATION PROCESSING LETTERS, 1986, 23 (04) : 209 - 214
[35] OPTIMAL MULTI-WAY SEARCH-TREES
GOTLIEB, L
SIAM JOURNAL ON COMPUTING, 1981, 10 (03) : 422 - 433
[36] SELF-ADJUSTING AUGMENTED SEARCH-TREES
LAI, TW
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 88 - 96
[37] GROWING NEARLY OPTIMAL BINARY SEARCH-TREES
KORSH, JF
INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 139 - 143
[38] GREEDY BINARY SEARCH-TREES ARE NEARLY OPTIMAL
KORSH, JF
INFORMATION PROCESSING LETTERS, 1981, 13 (01) : 16 - 19
[39] A SIMPLE AND POWERFUL REPRESENTATION OF BINARY SEARCH-TREES
ZHENG, SQ
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 507 : 192 - 198
[40] SELF-ADJUSTING BINARY SEARCH-TREES
SLEATOR, DD
TARJAN, RE
JOURNAL OF THE ACM, 1985, 32 (03) : 652 - 686

← 1 2 3 4 5 →