David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paper
Lower Bounds for Distributed Maximum-Finding Algorithms
Abstract
Tills paper establishes several lower bounds of the form Ω(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller. © 1984, ACM. All rights reserved.
Related
Hannah Kim, Celia Cintas, et al.
IJCAI 2023
Gosia Lazuka, Andreea Simona Anghel, et al.
SC 2024
Albert Atserias, Anuj Dawar, et al.
Journal of the ACM