Tight bounds on parallel list marking

DOI10.1006/JPDC.1998.1447MaRDI QIDQ1268796zbMATH OpenOpenAlexFDO

Authors Sandeep Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram Ranade

Publication date 24 November 2002

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1998.1447

zbMATH Keywords

list marking problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• A simple randomized parallel algorithm for list-ranking
• Deterministic coin tossing with applications to optimal parallel list ranking
• List-ranking on interconnection networks.
• Deterministic parallel list ranking
• scientific article; zbMATH DE number 1444289

This page was built for publication: Tight bounds on parallel list marking

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