Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
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
Shyam Marjit, Harshit Singh, et al.
WACV 2025
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010
Saurabh Paul, Christos Boutsidis, et al.
JMLR