Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- 1 October 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 30 (4) , 852-865
- https://doi.org/10.1145/2157.322410
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- The Weighted Euclidean 1-Center ProblemMathematics of Operations Research, 1983
- Parametric Combinatorial Computing and a Problem of Program Module DistributionJournal of the ACM, 1983
- Finding Least-Distances LinesSIAM Journal on Algebraic Discrete Methods, 1983
- A Shifting Algorithm for Min-Max Tree PartitioningJournal of the ACM, 1982
- Location on Tree Networks: P-Centre and n-Dispersion ProblemsMathematics of Operations Research, 1981
- Combinatorial Optimization with Rational Objective FunctionsMathematics of Operations Research, 1979
- A Fast Selection Algorithm and the Problem of Optimum Distribution of EffortJournal of the ACM, 1979
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Minimal ratio spanning treesNetworks, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976