Randomized parallel list ranking for distributed memory multiprocessors.

DOI10.1007/BF02700044MaRDI QIDQ676261zbMATHFDO

Authors Frank Dehne, Siang W. Song

Publication date 7 August 1997

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed systems (68M14)

Cites work

• scientific article; zbMATH DE number 410386 (Why is no real title available?)
• scientific article; zbMATH DE number 1142307 (Why is no real title available?)
• scientific article; zbMATH DE number 1555985 (Why is no real title available?)
• A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers
• A simple randomized parallel algorithm for list-ranking
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Parallel Tree Contraction Part 2: Further Applications
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
• Solving tree problems on a mesh-connected processor array

Cited in

(1)

• Efficient parallel graph algorithms for coarse grained multicomputers and BSP

This page was built for publication: Randomized parallel list ranking for distributed memory multiprocessors.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676261)