Faster optimal parallel prefix sums and list ranking
- 1 June 1989
- journal article
- Published by Elsevier in Information and Computation
- Vol. 81 (3) , 334-352
- https://doi.org/10.1016/0890-5401(89)90036-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic timeAlgorithmica, 1988
- Randomized parallel speedups for list rankingJournal of Parallel and Distributed 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
- Simulation of Parallel Random Access Machines by CircuitsSIAM Journal on Computing, 1984
- Parallel Prefix ComputationJournal of the ACM, 1980