Efficient Schemes for Parallel Communication
Author:
Open Access
- 26 June 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (3) , 507-517
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A logarithmic time sort for linear size networks1983
- Routing, merging and sorting on parallel models of computation1982
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Interconnection Networks for SIMD MachinesComputer, 1979
- A Sampler of Circuit Switching NetworksComputer, 1979
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- On the Distribution of the Number of Successes in Independent TrialsThe Annals of Mathematical Statistics, 1956
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952