POSSIBILISTIC SEARCH-TREES

被引：0

作者：

FLOWERS, PL

KANDEL, A

机构：

来源：

关键词：

D O I：

10.1016/S0165-0114(85)80002-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 24

页数：24

共 50 条

[1] ON BINARY SEARCH-TREES
DEPRISCO, R
DESANTIS, A
[J]. INFORMATION PROCESSING LETTERS, 1993, 45 (05) : 249 - 253
[2] PRIORITY SEARCH-TREES
MCCREIGHT, EM
[J]. SIAM JOURNAL ON COMPUTING, 1985, 14 (02) : 257 - 276
[3] A NEW CLASS OF BALANCED SEARCH-TREES - HALF-BALANCED BINARY SEARCH-TREES
OLIVIE, HJ
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1982, 16 (01): : 51 - 71
[4] RANDOMIZED SEARCH-TREES
ARAGON, CR
SEIDEL, RG
[J]. 30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 540 - 545
[5] BIASED SEARCH-TREES
BENT, SW
SLEATOR, DD
TARJAN, RE
[J]. SIAM JOURNAL ON COMPUTING, 1985, 14 (03) : 545 - 568
[6] DIGITAL SEARCH-TREES REVISITED
FLAJOLET, P
SEDGWICK, R
[J]. SIAM JOURNAL ON COMPUTING, 1986, 15 (03) : 748 - 767
[7] ENCODING SEARCH-TREES IN LISTS
VAISHNAVI, V
WOOD, D
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1982, 10 (3-4) : 237 - 246
[8] STRATIFIED BALANCED SEARCH-TREES
VANLEEUWEN, J
OVERMARS, MH
[J]. ACTA INFORMATICA, 1983, 18 (04) : 345 - 359
[9] BOUNDING THE DEPTH OF SEARCH-TREES
FRAENKEL, AS
KLEIN, ST
[J]. COMPUTER JOURNAL, 1993, 36 (07): : 668 - 678
[10] SEARCH-TREES AND BUBBLE MEMORIES
FLAJOLET, P
OTTMANN, T
WOOD, D
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1985, 19 (02): : 137 - 164