David Carmel, Haggai Roitman, et al.
ACM TIST
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
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Arnold L. Rosenberg
Journal of the ACM