-
1
-
-
0026986473
-
Optimal Sorting on Mesh-Connected Processor Arrays
-
ACM
-
Kaklamanis, C., D. Krizanc, ‘Optimal Sorting on Mesh-Connected Processor Arrays,’ Proc. 4th Symp. on Parallel Algorithms and Architectures, pp. 50–59, ACM, 1992.
-
(1992)
Proc. 4Th Symp. on Parallel Algorithms and Architectures
, pp. 50-59
-
-
Kaklamanis, C.1
Krizanc, D.2
-
3
-
-
0028263307
-
Derandomizing Algorithms for Routing and Sorting on Meshes
-
ACM-SIAM
-
Kaufmann, M., J.F. Sibeyn, T. Suel, ‘Derandomizing Algorithms for Routing and Sorting on Meshes,’ Proc. 5th Symp. on Discrete Algorithms, pp 669–679 ACM-SIAM, 1994.
-
(1994)
Proc. 5Th Symp. on Discrete Algorithms
, pp. 669-679
-
-
Kaufmann, M.1
Sibeyn, J.F.2
Suel, T.3
-
4
-
-
0027835985
-
Zero-One Sorting on the Mesh
-
Krizanc, D., L. Narayanan, ‘Zero-One Sorting on the Mesh,’ Proc. 5th Symp. on Parallel and Distributed Processing, IEEE, pp. 641–647, 1993.
-
(1993)
Proc. 5Th Symp. on Parallel and Distributed Processing, IEEE
, pp. 641-647
-
-
Krizanc, D.1
Narayanan, L.2
-
5
-
-
85029421552
-
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound
-
LNCS, Springer-Verlag
-
Kunde, M., ‘Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,’ Proc. European Symp. on Algorithms, LNCS 726, pp. 272–283, Springer-Verlag, 1993.
-
(1993)
Proc. European Symp. on Algorithms
, vol.726
, pp. 272-283
-
-
Kunde, M.1
-
6
-
-
85020074737
-
Hot-Potato Algorithms for Permutation Routing
-
June
-
Newman, I., A. Schuster, ‘Hot-Potato Algorithms for Permutation Routing,’ Proc. ISTCS, June 1993.
-
(1993)
Proc. ISTCS
-
-
Newman, I.1
Schuster, A.2
-
7
-
-
0000398654
-
An Optimal Sorting Algorithm for Mesh Connected Computers
-
ACM
-
Schnorr, C.P., A. Shamir, ‘An Optimal Sorting Algorithm for Mesh Connected Computers,’ Proc. 18th Symp. on Theory of Comp., pp. 255–263, ACM, 1986.
-
(1986)
Proc. 18Th Symp. on Theory of Comp
, pp. 255-263
-
-
Schnorr, C.P.1
Shamir, A.2
-
8
-
-
3042881883
-
-
Techn. Rep. MPI-I-94-102, revised and extended version, Max-Planck Institut für Informatik, Saarbrücken, Germany
-
Sibeyn, J.F., ‘Desnakification of Mesh Sorting Algorithms,’ Techn. Rep. MPI-I-94-102, revised and extended version, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1994.
-
(1994)
Desnakification of Mesh Sorting Algorithms
-
-
Sibeyn, J.F.1
-
9
-
-
0347965491
-
Permutation Routing on Meshes with Small Queues
-
LNCS, Springer Verlag, to appear
-
Sibeyn, J.F., B.S. Chlebus, M. Kaufmann, ‘Permutation Routing on Meshes with Small Queues,’ Proc. 19th Mathematical Foundations of Computer Science, LNCS, Springer Verlag, 1994, to appear.
-
(1994)
Proc. 19Th Mathematical Foundations of Computer Science
-
-
Sibeyn, J.F.1
Chlebus, B.S.2
Kaufmann, M.3
|