One-by-one cleaning for practical parallel list ranking
From MaRDI portal
Publication:1348937
DOI10.1007/s00453-001-0077-8zbMath1009.68193OpenAlexW2088115428MaRDI QIDQ1348937
Publication date: 21 May 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0077-8
Related Items (2)
Random permutations on distributed, external and hierarchical memory ⋮ List-ranking on interconnection networks.
This page was built for publication: One-by-one cleaning for practical parallel list ranking
