PARALLEL MERGE SORT

被引:429
作者
COLE, R
机构
关键词
D O I
10.1137/0217049
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:770 / 785
页数:16
相关论文
共 18 条
[1]   SORTING IN C LOG N PARALLEL STEPS [J].
AJTAI, M ;
KOMLOS, J ;
SZEMEREDI, E .
COMBINATORICA, 1983, 3 (01) :1-19
[2]  
Alon N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P502, DOI 10.1109/SFCS.1986.57
[3]  
AZAR Y, 1987, SIAM J COMPUT, V3, P458
[4]  
BEAME P, 1987, 19TH P ACM S THEOR C, P83
[5]  
BILARDI G, 1986, 20TH P ANN C INF SCI, P336
[6]   ROUTING, MERGING, AND SORTING ON PARALLEL MODELS OF COMPUTATION [J].
BORODIN, A ;
HOPCROFT, JE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (01) :130-145
[7]   SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS [J].
COLE, R .
JOURNAL OF THE ACM, 1987, 34 (01) :200-208
[8]   PARTITIONING POINT SETS IN ARBITRARY DIMENSION [J].
COLE, R .
THEORETICAL COMPUTER SCIENCE, 1987, 49 (2-3) :239-265
[9]  
COLE R, 1986, 243 NEW YORK U COUR
[10]  
COLE R, 1987, 277 NEW YORK U COUR