Arthur Nádas
IEEE Transactions on Neural Networks
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
R. Sebastian, M. Weise, et al.
ECPPM 2022
Conference paper
Predicting knowledge in an ontology stream
Freddy Lécué, Jeff Z. Pan
IJCAI 2013