THE AVERAGE COMPLEXITY OF DETERMINISTIC AND RANDOMIZED PARALLEL COMPARISON-SORTING ALGORITHMS

被引:14
作者
ALON, N
AZAR, Y
机构
[1] Tel Aviv Univ, Israel
关键词
D O I
10.1137/0217074
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
22
引用
收藏
页码:1178 / 1192
页数:15
相关论文
共 22 条
  • [1] AHO AV, 1974, DESIGN ANAL COMPUTER, P92
  • [2] SORTING IN C LOG N PARALLEL STEPS
    AJTAI, M
    KOMLOS, J
    SZEMEREDI, E
    [J]. COMBINATORICA, 1983, 3 (01) : 1 - 19
  • [3] Alon N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P502, DOI 10.1109/SFCS.1986.57
  • [4] ALON N, 1988, SIAM J DISCRETE MATH, V1, P269
  • [5] [Anonymous], 1985, PARALLEL SORTING ALG
  • [6] AZAR Y, 1987, SIAM J COMPUT, V3, P458
  • [7] PARALLEL SORTING
    BOLLOBAS, B
    THOMASON, A
    [J]. DISCRETE APPLIED MATHEMATICS, 1983, 6 (01) : 1 - 11
  • [8] BOLLOBAS B, 1986, RANDOM GRAPHS, pCH15
  • [9] ROUTING, MERGING, AND SORTING ON PARALLEL MODELS OF COMPUTATION
    BORODIN, A
    HOPCROFT, JE
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (01) : 130 - 145
  • [10] Gereb-Graus M., 1987, 28th Annual Symposium on Foundations of Computer Science (Cat. No.87CH2471-1), P195, DOI 10.1109/SFCS.1987.55