DIGITAL SEARCH-TREES REVISITED

被引：80

|

作者：

FLAJOLET, P ^{[1
]}

SEDGWICK, R ^{[1
]}

机构：

[1] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544

来源：

SIAM JOURNAL ON COMPUTING | 1986年 / 15卷 / 03期

关键词：

D O I：

10.1137/0215054

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：748 / 767

页数：20

相关论文

共 50 条

[31] PARALLEL PROCESSING OF COMBINATORIAL SEARCH-TREES
MONIEN, B
VORNBERGER, O
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 269 : 60 - 69
[32] A UNIFIED APPROACH TO THE PARALLEL CONSTRUCTION OF SEARCH-TREES
DAS, SK
MIN, KB
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 27 (01) : 71 - 78
[33] 2 NEW KINDS OF BIASED SEARCH-TREES
FEIGENBAUM, J
TARJAN, RE
[J]. BELL SYSTEM TECHNICAL JOURNAL, 1983, 62 (10): : 3139 - 3158
[34] BINARY SEARCH-TREES WITH BINARY COMPARISON COST
OTTMANN, T
ROSENBERG, AL
SIX, HW
WOOD, D
[J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1984, 13 (02): : 77 - 101
[35] ELIMINATING THE FLAG IN THREADED BINARY SEARCH-TREES
GORDON, D
[J]. INFORMATION PROCESSING LETTERS, 1986, 23 (04) : 209 - 214
[36] SELF-ADJUSTING AUGMENTED SEARCH-TREES
LAI, TW
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 88 - 96
[37] OPTIMAL MULTI-WAY SEARCH-TREES
GOTLIEB, L
[J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (03) : 422 - 433
[38] ASYMPTOTIC-BEHAVIOR OF THE LEMPEL-ZIV PARSING SCHEME AND DIGITAL SEARCH-TREES
JACQUET, P
SZPANKOWSKI, W
[J]. THEORETICAL COMPUTER SCIENCE, 1995, 144 (1-2) : 161 - 197
[39] A SIMPLE AND POWERFUL REPRESENTATION OF BINARY SEARCH-TREES
ZHENG, SQ
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 507 : 192 - 198
[40] GROWING NEARLY OPTIMAL BINARY SEARCH-TREES
KORSH, JF
[J]. INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 139 - 143

← 1 2 3 4 5 →