Danila Seliayeu, Quinn Pham, et al.
CASCON 2024
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
Shyam Marjit, Harshit Singh, et al.
WACV 2025
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023