The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Authors:
- 1 November 1988
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 3 (1-4) , 329-346
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- An optimal parallel algorithm for dynamic expression evaluation and its applicationsLecture Notes in Computer Science, 1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- On efficient parallel strong orientationInformation Processing Letters, 1985
- Optimal parallel generation of a computation tree formACM Transactions on Programming Languages and Systems, 1985
- An optimal parallel algorithm for integer sorting1985
- Parallel tree contraction and its application1985
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- On the Parallel Evaluation of Certain Arithmetic ExpressionsJournal of the ACM, 1975