SELF-ADJUSTING BINARY SEARCH-TREES

被引：628

作者：

SLEATOR, DD

TARJAN, RE

机构：

来源：

关键词：

D O I：

10.1145/3828.3835

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：652 / 686

页数：35

共 50 条

[1] SELF-ADJUSTING AUGMENTED SEARCH-TREES
LAI, TW
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 88 - 96
[2] SELF-ADJUSTING MULTIWAY SEARCH-TREES
MARTEL, C
[J]. INFORMATION PROCESSING LETTERS, 1991, 38 (03) : 135 - 141
[3] SELF-ADJUSTING K-ARY SEARCH-TREES
SHERK, M
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 381 - 392
[4] SELF-ADJUSTING K-ARY SEARCH-TREES
SHERK, M
[J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1995, 19 (01): : 25 - 44
[5] Self-Adjusting Binary Search Trees: What Makes Them Tick?
Chalermsook, Parinya
Goswami, Mayank
Kozma, Laszlo
Mehlhorn, Kurt
Saranurak, Thatchaphol
[J]. ALGORITHMS - ESA 2015, 2015, 9294 : 300 - 312
[6] ON BINARY SEARCH-TREES
DEPRISCO, R
DESANTIS, A
[J]. INFORMATION PROCESSING LETTERS, 1993, 45 (05) : 249 - 253
[7] AN EVALUATION OF SELF-ADJUSTING BINARY SEARCH TREE TECHNIQUES
BELL, J
GUPTA, G
[J]. SOFTWARE-PRACTICE & EXPERIENCE, 1993, 23 (04): : 369 - 382
[8] OPTIMAL BINARY SEARCH-TREES
DOBOSIEWICZ, W
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 19 (02) : 135 - 151
[9] 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
[10] Self-Adjusting Top Trees
Tarjan, Robert E.
Werneck, Renato F.
[J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 813 - 822