Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A
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
Joxan Jaffar
Journal of the ACM
Michael Hersche, Mustafa Zeqiri, et al.
NeSy 2023
Conference paper
Tutorials and Technical Briefings at ISEC 2025
Atul Kumar
ISEC 2025