CONSTRUCTION OF OPTIMAL BINARY SPLIT TREES IN THE PRESENCE OF BOUNDED ACCESS PROBABILITIES

被引：0

作者：

HESTER, JH ^{[1
]}

HIRSCHBERG, DS ^{[1
]}

LARMORE, LL ^{[1
]}

机构：

[1] UNIV CALIF IRVINE,DEPT INFORMAT & COMP SCI,IRVINE,CA 92717

来源：

关键词：

D O I：

10.1016/0196-6774(88)90040-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：245 / 253

页数：9

共 50 条

[1] FASTER CONSTRUCTION OF OPTIMAL BINARY SPLIT TREES
HESTER, JH
HIRSCHBERG, DS
HUANG, SHS
WONG, CK
JOURNAL OF ALGORITHMS, 1986, 7 (03) : 412 - 424
[2] OPTIMAL BINARY SPLIT TREES
HUANG, SHS
WONG, CK
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1984, 5 (01): : 69 - 79
[3] Optimal binary search trees with costs depending on the access paths
Szwarcfiter, JL
Navarro, G
BaezaYates, R
Oliveira, JD
Cunto, W
Ziviani, N
THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) : 1799 - 1814
[4] Optimal binary search trees with costs depending on the access paths
Szwarcfiter, JL
ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2003, 2653 : 2 - 2
[5] GENERALIZED BINARY SPLIT TREES
HUANG, SHS
WONG, CK
ACTA INFORMATICA, 1984, 21 (01) : 113 - 123
[6] On a sublinear time parallel construction of optimal binary search trees
Karpinski, Marek
Rytter, Wojciech
Parallel Processing Letters, 1998, 8 (03): : 387 - 397
[7] OPTIMAL MULTIWAY SPLIT TREES
HUANG, SHS
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1987, 8 (01): : 146 - 156
[8] Parallel construction of binary trees with near optimal weighted path length
Kirkpatrick, DG
Przytycka, T
ALGORITHMICA, 1996, 15 (02) : 172 - 192
[9] Efficient Construction of Near-Optimal Binary and Multiway Search Trees
Bose, Prosenjit
Douieb, Karim
ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 230 - 241
[10] OPTIMAL PARALLEL CONFLICT-FREE ACCESS TO EXTENDED BINARY-TREES
CREUTZBURG, R
ANDREWS, L
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 399 : 214 - 225