Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
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
Gosia Lazuka, Andreea Simona Anghel, et al.
SC 2024
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Zhikun Yuen, Paula Branco, et al.
DSAA 2023