Optimal parallel algorithms for expression tree evaluation and list ranking
- 3 August 2006
- book chapter
- Published by Springer Nature
- p. 91-100
- https://doi.org/10.1007/bfb0040377
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Parallel Symmetry-Breaking in Sparse GraphsPublished by Defense Technical Information Center (DTIC) ,1988
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- Approximate and exact parallel scheduling with applications to list, tree and graph problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- Optimal parallel generation of a computation tree formACM Transactions on Programming Languages and Systems, 1985
- An optimal parallel algorithm for integer sortingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parallel tree contraction and its applicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974