Harsha Kokel, Aamod Khatiwada, et al.
VLDB 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
Cristina Cornelio, Judy Goldsmith, et al.
JAIR
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996