Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl, E. Korach, D. Rotem

Research output: Contribution to journalArticlepeer-review

52 Scopus citations

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.

Original languageEnglish
Pages (from-to)905-918
Number of pages14
JournalJournal of the ACM
Volume31
Issue number4
DOIs
StatePublished - 20 Sep 1984
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Hardware and Architecture
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Lower Bounds for Distributed Maximum-Finding Algorithms'. Together they form a unique fingerprint.

Cite this