Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
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
Saurabh Paul, Christos Boutsidis, et al.
JMLR
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006