Distributed election in complete networks

DOI10.1007/BF01788564MaRDI QIDQ1112606zbMATH OpenFDO

Authors Mee Yee Chan, Francis Y. L. Chin

Publication date 1988

Published in Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

complete networksdistributed electionexpected message complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99)

Cites work

• Lower Bounds for Distributed Maximum-Finding Algorithms
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks

Cited in

(5)

• How to assign votes in a distributed system
• Leader election in complete networks
• A distributed voting scheme to maximize preferences
• The Power of Two Choices in Distributed Voting
• Distributed election in a circle without a global sense of orientation

This page was built for publication: Distributed election in complete networks

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