Arnold.L. Rosenberg
Journal of the ACM
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
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Kenneth L. Clarkson, Elad Hazan, et al.
Journal of the ACM
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011