Randomized parallel list ranking for distributed memory multiprocessors.

DOI10.1007/BF02700044zbMath1067.68792MaRDI QIDQ676261

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

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

Related Items (1)

Efficient parallel graph algorithms for coarse grained multicomputers and BSP

Cites Work

• A simple randomized parallel algorithm for list-ranking
• A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers
• Solving tree problems on a mesh-connected processor array
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

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