Journal ArticleOPEN ACCESS

Lower Bounds for Distributed Maximum-Finding Algorithms

Journal of the ACM (JACM) (1984) 31(4) 905-918
DOI: 10.1145/1634.1889
53Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Pachl, J. K., Korach, E., & Rotem, D. (1984). Lower Bounds for Distributed Maximum-Finding Algorithms. Journal of the ACM (JACM), 31(4), 905–918. https://doi.org/10.1145/1634.1889

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free