Pachl, J.; Korach, E.; Rotem, D. Lower bounds for distributed maximum-fiding algorithms. (English) Zbl 0628.68046 J. Assoc. Comput. Mach. 31, 905-918 (1984). This paper establishes several lower bounds of the form \(\Omega\) (n log n) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller. Cited in 19 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68N25 Theory of operating systems Keywords:distributed algorithms; message complexity; communication rings; election algorithms; lower bounds; number of messages; maximum label in a circular configuration of n labeled processes PDFBibTeX XMLCite \textit{J. Pachl} et al., J. Assoc. Comput. Mach. 31, 905--918 (1984; Zbl 0628.68046) Full Text: DOI