George Saon
SLT 2014
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
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023
Miao Guo, Yong Tao Pei, et al.
WCITS 2011