Laura Mismetti, Marvin Alberts, et al.
ACS Fall 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
Wooseok Choi, Tommaso Stecconi, et al.
Advanced Science
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
Segev Shlomov, Avi Yaeli
CHI 2024