Susan L. Spraragen
International Conference on Design and Emotion 2010
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
Saurabh Paul, Christos Boutsidis, et al.
JMLR
Shyam Marjit, Harshit Singh, et al.
WACV 2025