Asymptotically optimal election on weighted rings

DOI10.1007/3-540-58218-5_19zbMath1502.68364OpenAlexW2156840418MaRDI QIDQ5054762

Lisa Higham, Teresa M. Przytycka

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_19

Mathematics Subject Classification ID

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

Related Items (1)

Optimal cost-sensitive distributed minimum spanning tree algorithm

Cites Work

• A simple, efficient algorithm for maximum finding on rings
• Lower Bounds for Distributed Maximum-Finding Algorithms
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• 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