SORTING, MINIMAL FEEDBACK SETS, AND HAMILTON PATHS IN TOURNAMENTS

[1] SORTING IN C LOG N PARALLEL STEPS [J]. COMBINATORICA, 1983, 3 (01) : 1 - 19

[2] AJTAI M, 1986, 18TH P ANN ACM S THE, P188

[3] THE AVERAGE COMPLEXITY OF DETERMINISTIC AND RANDOMIZED PARALLEL COMPARISON-SORTING ALGORITHMS [J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (06) : 1178 - 1192

[4] Alon N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P502, DOI 10.1109/SFCS.1986.57

[5] EIGENVALUES, GEOMETRIC EXPANDERS, SORTING IN ROUNDS, AND RAMSEY THEORY [J]. COMBINATORICA, 1986, 6 (03) : 207 - 219

[6] ALON N, UNPUB MAXIMUM NUMBER

[7] ALON N, 1988, SIAM J DISCRETE MATH, V1, P269

[8] TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING [J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (03) : 458 - 464

[9] BEAME P, 1986, 18TH P ANN ACM S THE, P169

[10] Berge C., 1973, GRAPHS HYPERGRAPHS

[1] SORTING IN C LOG N PARALLEL STEPS [J]. COMBINATORICA, 1983, 3 (01) : 1 - 19

[2] AJTAI M, 1986, 18TH P ANN ACM S THE, P188

[3] THE AVERAGE COMPLEXITY OF DETERMINISTIC AND RANDOMIZED PARALLEL COMPARISON-SORTING ALGORITHMS [J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (06) : 1178 - 1192

[4] Alon N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P502, DOI 10.1109/SFCS.1986.57

[5] EIGENVALUES, GEOMETRIC EXPANDERS, SORTING IN ROUNDS, AND RAMSEY THEORY [J]. COMBINATORICA, 1986, 6 (03) : 207 - 219

[6] ALON N, UNPUB MAXIMUM NUMBER

[7] ALON N, 1988, SIAM J DISCRETE MATH, V1, P269

[8] TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING [J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (03) : 458 - 464

[9] BEAME P, 1986, 18TH P ANN ACM S THE, P169

[10] Berge C., 1973, GRAPHS HYPERGRAPHS