A NEW PARALLEL SORTING ALGORITHM BASED UPON MIN-MID-MAX OPERATIONS

[1] PARALLEL COMPLEXITY OF SORTING PROBLEMS [J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 79 - 88

[2] BARLOW H, 1981, INFOR P LETT, V13, P103

[3] BAUDET G, 1978, IEEE T COMPUT, V27, P84, DOI 10.1109/TC.1978.1674957

[4] DIAMOND - A SORTING METHOD FOR VECTOR MACHINES [J]. BIT, 1981, 21 (02): : 142 - 152

[5] CHEN TC, 1978, IJCIS, V7, P293

[6] CHIN FY, 1980, IEEE T COMPUT, V29, P618, DOI 10.1109/TC.1980.1675633

[7] MERGING WITH PARALLEL PROCESSORS [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (10) : 588 - 591

[8] HAGGKVIST R, 1981, SIAM J COMPUT, V10, P465, DOI 10.1137/0210034

[9] FAST PARALLEL SORTING ALGORITHMS [J]. COMMUNICATIONS OF THE ACM, 1978, 21 (08) : 657 - 661

[10] Hockney R., 1981, PARALLEL COMPUTERS

[1] PARALLEL COMPLEXITY OF SORTING PROBLEMS [J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 79 - 88

[2] BARLOW H, 1981, INFOR P LETT, V13, P103

[3] BAUDET G, 1978, IEEE T COMPUT, V27, P84, DOI 10.1109/TC.1978.1674957

[4] DIAMOND - A SORTING METHOD FOR VECTOR MACHINES [J]. BIT, 1981, 21 (02): : 142 - 152

[5] CHEN TC, 1978, IJCIS, V7, P293

[6] CHIN FY, 1980, IEEE T COMPUT, V29, P618, DOI 10.1109/TC.1980.1675633

[7] MERGING WITH PARALLEL PROCESSORS [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (10) : 588 - 591

[8] HAGGKVIST R, 1981, SIAM J COMPUT, V10, P465, DOI 10.1137/0210034

[9] FAST PARALLEL SORTING ALGORITHMS [J]. COMMUNICATIONS OF THE ACM, 1978, 21 (08) : 657 - 661

[10] Hockney R., 1981, PARALLEL COMPUTERS