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
来源：
SIAM JOURNAL ON COMPUTING | 1987年 / 16卷 / 03期
关键词：
D O I：
10.1137/0216032
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：458 / 464
页数：7
相关论文
共 50 条
  • [1] TIGHT BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING
    LEIGHTON, T
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (04) : 344 - 354
  • [2] TIGHT CHIP AREA BOUNDS FOR SORTING
    DURIS, P
    THOMPSON, CD
    SYKORA, O
    VRTO, I
    [J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1985, 4 (06): : 535 - 544
  • [3] Tight bounds for online stable sorting
    Gagie, Travis
    Nekrich, Yakov
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2011, 9 (02) : 176 - 181
  • [4] THE COMPLEXITY OF PARALLEL SORTING
    DERHEIDE, FMA
    WIGDERSON, A
    [J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (01) : 100 - 107
  • [5] Bounds on complexity when sorting reals
    Jiřina, Marcel
    [J]. Jiřina, Marcel, 1600, North Atlantic University Union, 942 Windemere Dr. NW.,, Salem, Oregon 97304, United States (14): : 276 - 281
  • [6] Tight Lower Bounds for the Complexity of Multicoloring
    Bonamy, Marthe
    Kowalik, Lukasz
    Pilipczuk, Michal
    Socala, Arkadiusz
    Wrochna, Marcin
    [J]. ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (03)
  • [7] PARALLEL COMPLEXITY OF SORTING PROBLEMS
    AIGNER, M
    [J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 79 - 88
  • [8] Tight bounds on parallel list marking
    Bhatt, SN
    Bilardi, G
    Herley, KT
    Pucci, G
    Ranade, A
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 51 (02) : 75 - 88
  • [9] 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
  • [10] Tight Bounds on the Descriptional Complexity of Regular Expressions
    Gruber, Hermann
    Holzer, Markus
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 276 - 287
12345