Finding the extrema of a distributed multiset

DOI10.1006/JPDC.1996.0113MaRDI QIDQ2563978zbMATH OpenOpenAlexFDO

Authors Paola Alimonti, P. Flocchini, N. Santoro

Publication date 1996

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

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

zbMATH Keywords

extrema of a distributed multiset

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Some lower bound results for decentralized extrema-finding in rings of processors
• New lower bound techniques for distributed leader finding and other problems on rings of processors
• scientific article; zbMATH DE number 3978376
• A simple, efficient algorithm for maximum finding on rings
• scientific article; zbMATH DE number 403951

Cited in

(5)

• Distributed algorithm for extrema-finding in circular configuration of processors
• Tight bounds for synchronous communication of information using bits and silence
• Finding extrema with unary predicates
• scientific article; zbMATH DE number 403951 (Why is no real title available?)
• On the microscopic view of time and messages

This page was built for publication: Finding the extrema of a distributed multiset

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