Randomized parallel list ranking for distributed memory multiprocesors
From MaRDI portal
Publication:6560349
DOI10.1007/BFB0027774zbMATH Open1541.68431MaRDI QIDQ6560349
Publication date: 21 June 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simple randomized parallel algorithm for list-ranking
- 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
- Direct bulk-synchronous parallel algorithms
This page was built for publication: Randomized parallel list ranking for distributed memory multiprocesors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560349)