Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
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
Amy Lin, Sujit Roy, et al.
AGU 2024
Conference paper
Representing and Reasoning with Defaults for Learning Agents
Benjamin N. Grosof
AAAI-SS 1993
Rama Akkiraju, Pinar Keskinocak, et al.
Applied Intelligence