Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
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
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.