Zijian Ding, Michelle Brachman, et al.
C&C 2025
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
Amy Lin, Sujit Roy, et al.
AGU 2024
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023