P.C. Yue, C.K. Wong
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
Takeshi Yoshimura
PyTorch Conference 2026
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Cristina Cornelio, Judy Goldsmith, et al.
JAIR