Routing, Merging, and Sorting on Parallel Models of Computation

[1]  Debasis Mitra,et al.  Randomized Parallel Communications , 1986, ICPP.

[2]  Marc Snir,et al.  On Parallel Searching , 2011, SIAM J. Comput..

[3]  Uzi Vishkin,et al.  Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[4]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[5]  Clyde P. Kruskal,et al.  Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.

[6]  R. Häggkvist,et al.  Sorting and Merging in Rounds , 1982 .

[7]  A. K. Chandra,et al.  A complexity theory for unbounded fan-in parallelism , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[8]  Leslie G. Valiant,et al.  A logarithmic time sort for linear size networks , 1982, STOC 1983.

[9]  Eli Upfal,et al.  Efficient schemes for parallel communication , 1982, PODC '82.

[10]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[11]  Pavol Hell,et al.  Parallel Sorting with Constant Time for Comparisons , 1981, SIAM J. Comput..

[12]  Uzi Vishkin,et al.  Finding the maximum, merging and sorting in a parallel computation model , 1981, CONPAR.

[13]  Wolfgang J. Paul,et al.  An efficient general purpose parallel computer , 1981, STOC '81.

[14]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[15]  Stephen A. Cook,et al.  Hardware complexity and parallel computation , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[16]  Franco P. Preparata,et al.  New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.

[17]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[18]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[19]  Tomás Lang,et al.  Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network , 1976, IEEE Transactions on Computers.

[20]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[21]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.