Distributed election in a circle without a global sense of orientation

DOI10.1080/00207168408803429zbMath0547.68043OpenAlexW1973319314MaRDI QIDQ3339287

Doron Rotem, Ephraim Korach, Nicola Santoro

Publication date: 1984

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168408803429

zbMATH Keywords

distributed algorithmsextrema findinglocal orientationelection problembidirectional message-passingcircles of processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Cites Work

• 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: Distributed election in a circle without a global sense of orientation