Joxan Jaffar
Journal of the ACM
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
Yale Song, Zhen Wen, et al.
IJCAI 2013
Wooseok Choi, Tommaso Stecconi, et al.
Advanced Science
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023