A simple, efficient algorithm for maximum finding on rings

DOI10.1016/0020-0190(96)00069-5zbMath0900.68018OpenAlexW2094575019WikidataQ127814544 ScholiaQ127814544MaRDI QIDQ671266

Lisa Higham, Teresa M. Przytycka

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00069-5

zbMATH Keywords

Distributed algorithmsAsynchronous ringsMaximum findingMessage complexity

Mathematics Subject Classification ID

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

Related Items (4)

Asymptotically optimal election on weighted rings ⋮ Cost distribution of the Chang-Roberts leader election algorithm and related problems ⋮ A simple, efficient algorithm for maximum finding on rings ⋮ Asymptotically Optimal Election on Weighted Rings

Cites Work

• A simple, efficient algorithm for maximum finding on rings
• Some lower bound results for decentralized extrema-finding in rings of processors
• Lower Bounds for Distributed Maximum-Finding Algorithms
• Decentralized extrema-finding in circular configurations of processors
• 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
• An improved algorithm for decentralized extrema-finding in circular configurations of processes

This page was built for publication: A simple, efficient algorithm for maximum finding on rings