A simple randomized parallel algorithm for list-ranking

DOI10.1016/0020-0190(90)90196-5zbMath0696.68047OpenAlexW2034924661WikidataQ30051916 ScholiaQ30051916MaRDI QIDQ911268

Richard J. Anderson, Gary Lee Miller

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90196-5

zbMATH Keywords

analysis of algorithmsparallel processingEREW PRAM

Mathematics Subject Classification ID

Related Items (3)

Efficient massively parallel implementation of some combinatorial algorithms ⋮ Adapting parallel algorithms to the W-stream model, with applications to graph problems ⋮ Randomized parallel list ranking for distributed memory multiprocessors.

Cites Work

• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
• An Efficient Parallel Biconnectivity Algorithm

This page was built for publication: A simple randomized parallel algorithm for list-ranking