Communication-efficient parallel algorithms for distributed random-access machines
- 1 November 1988
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 3 (1-4), 53-77
- https://doi.org/10.1007/bf01762110
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A new approach to the maximum flow problemPublished by Association for Computing Machinery (ACM) ,1986
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithmsPublished by Association for Computing Machinery (ACM) ,1986
- “Hot spot” contention and combining in multistage interconnection networksIEEE Transactions on Computers, 1985
- Fat-trees: Universal networks for hardware-efficient supercomputingIEEE Transactions on Computers, 1985
- Computer RecreationsScientific American, 1985
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- A Regular Layout for Parallel AddersIEEE Transactions on Computers, 1982
- Parallel Prefix ComputationJournal of the ACM, 1980
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952