Routing, merging and sorting on parallel models of computation
Authors:
- A. BorodinABA. Borodin
- J. E. HopcroftJHJ. E. Hopcroft
Open Access
- 5 May 1982
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 338-344
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983
- Bounds on the time for parallel RAM's to compute simple functions1982
- Parity, circuits, and the polynomial-time hierarchy1981
- Universal schemes for parallel communication1981
- An efficient general purpose parallel computer1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- The cube-connected-cycles: A versatile network for parallel computation1979
- A unified approach to models of synchronous parallel machines1978
- Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange NetworkIEEE Transactions on Computers, 1976
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975