Deterministic parallel list ranking
- 1 June 1991
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 6 (6) , 859-868
- https://doi.org/10.1007/bf01759076
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Optimal parallel evaluation of tree-structured computations by raking (extended abstract)Published by Springer Nature ,2006
- Optimal and Sublogarithmic Time Randomized Parallel Sorting AlgorithmsSIAM Journal on Computing, 1989
- 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
- Optimal Tree Contraction in the EREW ModelPublished by Springer Nature ,1988
- Parallel symmetry-breaking in sparse graphsPublished by Association for Computing Machinery (ACM) ,1987
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- Parallel tree contraction and its applicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Randomized speed-ups in parallel computationPublished by Association for Computing Machinery (ACM) ,1984