On a sublinear time parallel construction of optimal binary search trees

被引：0

|

作者：

Karpinski, Marek ^{[1
]}

Rytter, Wojciech ^{[1
]}

机构：

[1] Univ of Bonn, Bonn, Germany

来源：

Parallel Processing Letters | 1998年 / 8卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：387 / 397

相关论文

共 50 条

[1] Parallel construction of multidimensional binary search trees
Al-Furaih, I
Aluru, S
Goil, S
Ranka, S
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2000, 11 (02) : 136 - 148
[2] Optimal binary search trees
Nagaraj, SV
THEORETICAL COMPUTER SCIENCE, 1997, 188 (1-2) : 1 - 44
[3] Parallel construction of binary trees with near optimal weighted path length
Kirkpatrick, DG
Przytycka, T
ALGORITHMICA, 1996, 15 (02) : 172 - 192
[4] Efficient Construction of Near-Optimal Binary and Multiway Search Trees
Bose, Prosenjit
Douieb, Karim
ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 230 - 241
[5] PARALLEL BALANCING OF BINARY SEARCH TREES
CHANG, S
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (04) : 441 - 444
[6] PARALLEL GENERATION OF BINARY SEARCH TREES
WONG, CK
CHANG, SK
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (03) : 268 - 271
[7] Optimal alphabetic trees for binary search
Hu, TC
Tucker, PA
INFORMATION PROCESSING LETTERS, 1998, 67 (03) : 137 - 140
[8] OPTIMAL BINARY SEARCH-TREES
DOBOSIEWICZ, W
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 19 (02) : 135 - 151
[9] Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
Karpinski, M
Larmore, LL
Rytter, W
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 36 - 41
[10] CONSTRUCTION OF BALANCED BINARY TREES FOR PARALLEL PROCESSING
EVANS, DJ
SMITH, SA
COMPUTER JOURNAL, 1977, 20 (04): : 378 - 379

← 1 2 3 4 5 →