Conrad Albrecht, Jannik Schneider, et al.
CVPR 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
Vicki L Hanson, Edward H Lichtenstein
Cognitive Psychology
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Basel Shbita, Pengyuan Li, et al.
ESWC 2026