Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
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
Michael Hersche, Mustafa Zeqiri, et al.
NeSy 2023
Rangachari Anand, Kishan Mehrotra, et al.
IEEE Transactions on Neural Networks
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence