Rie Kubota Ando
CoNLL 2006
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
Conference paper
Representing and Reasoning with Defaults for Learning Agents
Benjamin N. Grosof
AAAI-SS 1993
Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023
P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings