Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
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
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
Miao Guo, Yong Tao Pei, et al.
WCITS 2011