Lower Bounds for Distributed Maximum-Finding Algorithms
Jan K. Pachl, Ephraim Korach, Doron Rotem · Journal of the ACM · 1984
Tills paper establishes several lower bounds of the form f~(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller.