THE COMPLEXITY OF PARALLEL SORTING

被引：4

|

作者：

DERHEIDE, FMA ^{[1
]}

WIGDERSON, A ^{[1
]}

机构：

[1] MATH SCI RES INST,BERKELEY,CA 94720

来源：

SIAM JOURNAL ON COMPUTING | 1987年 / 16卷 / 01期

关键词：

D O I：

10.1137/0216008

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：100 / 107

页数：8

相关论文

共 50 条

[1] PARALLEL COMPLEXITY OF SORTING PROBLEMS
AIGNER, M
[J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 79 - 88
[2] TIGHT BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING
LEIGHTON, T
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (04) : 344 - 354
[3] TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING
AZAR, Y
VISHKIN, U
[J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (03) : 458 - 464
[4] THE AVERAGE-CASE PARALLEL COMPLEXITY OF SORTING
BOPPANA, RB
[J]. INFORMATION PROCESSING LETTERS, 1989, 33 (03) : 145 - 146
[5] Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting
Yang, Wentao
Harsh, Vipul
Solomonik, Edgar
[J]. PROCEEDINGS OF THE 35TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2023, 2023, : 467 - 478
[6] THE AVERAGE COMPLEXITY OF DETERMINISTIC AND RANDOMIZED PARALLEL COMPARISON-SORTING ALGORITHMS
ALON, N
AZAR, Y
[J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (06) : 1178 - 1192
[7] Sorting in parallel
Libeskind-Hadas, R
[J]. AMERICAN MATHEMATICAL MONTHLY, 1998, 105 (03): : 238 - 245
[8] PARALLEL SORTING
BOLLOBAS, B
THOMASON, A
[J]. DISCRETE APPLIED MATHEMATICS, 1983, 6 (01) : 1 - 11
[9] ON THE COMPLEXITY OF TOPOLOGICAL SORTING
TODA, S
[J]. INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 229 - 233
[10] THE VLSI COMPLEXITY OF SORTING
THOMPSON, CD
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1983, 32 (12) : 1171 - 1184

← 1 2 3 4 5 →