A ROBUST SORTING NETWORK

[1] BENES VE, 1965, MATH THEORY CONNECTI

[2] BORODIN A, 1982, 14TH P ACM S THEOR C, P338

[3] A STUDY OF NON-BLOCKING SWITCHING NETWORKS [J]. BELL SYSTEM TECHNICAL JOURNAL, 1953, 32 (02): : 406 - 424

[4] DOWD M, 1983, ACM S P DISTRIBUTED, P161

[5] HONG Z, 1982, 14TH P ANN ACM S THE, P296

[6] Knuth D. E., 1968, ART COMPUTER PROGRAM, V3

[7] KRUSKAL CP, 1983, IEEE T COMPUT, V32, P942, DOI 10.1109/TC.1983.1676138

[8] PERL Y, 1983, BITONIC ODD EVEN NET

[9] REIF JH, 1983, 15TH P ANN ACM S THE, P10

[10] PARALLEL PROCESSING WITH PERFECT SHUFFLE [J]. IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (02) : 153 - &

[1] BENES VE, 1965, MATH THEORY CONNECTI

[2] BORODIN A, 1982, 14TH P ACM S THEOR C, P338

[3] A STUDY OF NON-BLOCKING SWITCHING NETWORKS [J]. BELL SYSTEM TECHNICAL JOURNAL, 1953, 32 (02): : 406 - 424

[4] DOWD M, 1983, ACM S P DISTRIBUTED, P161

[5] HONG Z, 1982, 14TH P ANN ACM S THE, P296

[6] Knuth D. E., 1968, ART COMPUTER PROGRAM, V3

[7] KRUSKAL CP, 1983, IEEE T COMPUT, V32, P942, DOI 10.1109/TC.1983.1676138

[8] PERL Y, 1983, BITONIC ODD EVEN NET

[9] REIF JH, 1983, 15TH P ANN ACM S THE, P10

[10] PARALLEL PROCESSING WITH PERFECT SHUFFLE [J]. IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (02) : 153 - &