Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
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
Wooseok Choi, Tommaso Stecconi, et al.
Advanced Science
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Conference paper
Reasoning about Noisy Sensors in the Situation Calculus
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995