Complexity Results for Permuting Data and Other Computations on Parallel Processors
- 30 March 1984
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (2) , 193-209
- https://doi.org/10.1145/62.322423
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Universal schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Some Complexity Results for Matrix Computations on Parallel ProcessorsJournal of the ACM, 1978
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- Banyan networks for partitioning multiprocessor systemsACM SIGARCH Computer Architecture News, 1973
- Optimal algorithms for parallel polynomial evaluationJournal of Computer and System Sciences, 1973
- On a Class of Rearrangeable Switching Networks Part I: Control AlgorithmBell System Technical Journal, 1971
- A Permutation NetworkJournal of the ACM, 1968
- A Study of Non-Blocking Switching NetworksBell System Technical Journal, 1953