Shyam Marjit, Harshit Singh, et al.
WACV 2025
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
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI