An efficient message passing election algorithm based on Mazurkiewicz's algorithm

MaRDI QIDQ5431920zbMATH OpenFDO

Authors J. Chalopin, Yves Métivier

Publication date 2 January 2008

zbMATH Keywords

anonymous networkasynchronous message passing modelcoveringdistributed algorithmelectionlocal computationnaming

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• Distributed election in a circle without a global sense of orientation
• scientific article; zbMATH DE number 1759418
• scientific article; zbMATH DE number 6313182

Cited in

(2)

• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• Drawing maps with advice

This page was built for publication: An efficient message passing election algorithm based on Mazurkiewicz's algorithm

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