Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks

DOI10.1137/0220023zbMath0722.68006MaRDI QIDQ3210138

Yehuda Afek, Eli Gafni

Publication date: 1991

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220023

zbMATH Keywords

distributed algorithms; leader election algorithms; complete networks; time-message complexities trade-off

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

94C15: Applications of graph theory to circuits and networks

68W15: Distributed algorithms

Related Items

An improved algorithm for finding the median distributively, Distributed election in complete networks, On a game in directed graphs.