Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms
Authors:
- Richard ColeRCRichard Cole
- Uzi VishkinUVUzi Vishkin
Open Access
- 1 May 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 92 (1) , 1-47
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- An optimal parallel algorithm for building a data structure for planar point locationJournal of Parallel and Distributed Computing, 1990
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic timeAlgorithmica, 1988
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- An optimally efficient selection algorithmInformation Processing Letters, 1988
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- Finding Euler tours in parallelJournal of Computer and System Sciences, 1984
- Parallel strong orientation of an undirected graphInformation Processing Letters, 1984
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 1982
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974