Distributed election in complete networks

DOI10.1007/BF01788564zbMath0659.68065MaRDI QIDQ1112606

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

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

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