Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
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
Program equivalence and context-free grammars
Barry K. Rosen
SWAT 1972
Arthur Nádas
IEEE Transactions on Neural Networks
Conference paper
Risks and potentials of using EMV for internet payments
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999