Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- 1 February 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (1), 128-142
- https://doi.org/10.1137/0217009
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithmsInformation and Computation, 1991
- On finding lowest common ancestors: Simplification and parallelizationPublished by Springer Nature ,1988
- Sorting and Selecting in RoundsSIAM Journal on Computing, 1987
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- On efficient parallel strong orientationInformation Processing Letters, 1985
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974