R. Sebastian, M. Weise, et al.
ECPPM 2022
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
Ella Barkan, Ibrahim Siddiqui, et al.
Computational And Structural Biotechnology Journal
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
George Saon
SLT 2014