TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING

被引：17

作者：

AZAR, Y ^{[1
]}

VISHKIN, U ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,DEPT COMP SCI,NEW YORK,NY 10012

来源：

关键词：

D O I：

10.1137/0216032

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：458 / 464

页数：7

共 20 条

[1] SORTING IN C LOG N PARALLEL STEPS
AJTAI, M
KOMLOS, J
SZEMEREDI, E
[J]. COMBINATORICA, 1983, 3 (01) : 1 - 19
[2] ALON N, 1985, 17TH P ANN ACM S THE, P98
[3] [Anonymous], 1985, PARALLEL SORTING ALG
[4] AUFDERHEIDE FM, 1985, 26TH P IEEE S F COMP, P532
[5] SORTING IN ONE ROUND
BOLLOBAS, B
ROSENFELD, M
[J]. ISRAEL JOURNAL OF MATHEMATICS, 1981, 38 (1-2) : 154 - 160
[6] PARALLEL SORTING
BOLLOBAS, B
THOMASON, A
[J]. DISCRETE APPLIED MATHEMATICS, 1983, 6 (01) : 1 - 11
[7] BOLLOBAS B, SORTING GRAPHS
[8] BOLLOBAS B, SORTING ALGORITHMS
[9] BORODIN A, 1982, 14TH P ACM S THEOR C, P338
[10] HAGGKVIST R, 1981, SIAM J COMPUT, V10, P465, DOI 10.1137/0210034