A simple randomized parallel algorithm for list-ranking
From MaRDI portal
Publication:911268
DOI10.1016/0020-0190(90)90196-5zbMATH Open0696.68047OpenAlexW2034924661WikidataQ30051916 ScholiaQ30051916MaRDI QIDQ911268FDOQ911268
Authors: Richard J. Anderson, Gary L. 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
Recommendations
- Practical parallel list ranking
- Deterministic parallel list ranking
- scientific article; zbMATH DE number 4064468
- scientific article; zbMATH DE number 1444289
- Efficient ranking and selection in parallel computing environments
- On the complexity of list ranking in the parallel external memory model
- Faster optimal parallel prefix sums and list ranking
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Theory of operating systems (68N25)
Cites Work
Cited In (12)
- Randomized parallel list ranking for distributed memory multiprocesors
- A new family of randomized algorithms for list accessing
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- Title not available (Why is that?)
- List-ranking on interconnection networks.
- Efficient massively parallel implementation of some combinatorial algorithms
- Title not available (Why is that?)
- One-by-one cleaning for practical parallel list ranking
- Faster optimal parallel prefix sums and list ranking
- Efficient list ranking on the reconfigurable mesh, with applications
- Randomized parallel list ranking for distributed memory multiprocessors.
- Deterministic coin tossing with applications to optimal parallel list ranking
This page was built for publication: A simple randomized parallel algorithm for list-ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911268)
