Asymptotically Optimal Election on Weighted Rings

DOI10.1137/S0097539795288799zbMath0914.68095OpenAlexW1971073047MaRDI QIDQ4210174

Lisa Higham, Teresa M. Przytycka

Publication date: 21 September 1998

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

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

zbMATH Keywords

asynchronous networkmessage complexitydistributed electionweighted ring

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (1)

Hundreds of impossibility results for distributed computing

Cites Work

• A simple, efficient algorithm for maximum finding on rings
• Lower Bounds for Distributed Maximum-Finding Algorithms
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

This page was built for publication: Asymptotically Optimal Election on Weighted Rings