Two absolute bounds for distributed bit complexity

Yefim Dinitz, Noam Solomon

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

Abstract

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied bit complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader Election, which remained open. The first is to close the gap between the known upper and lower bounds, for electing a leader by two linked processors. The second is whether the known algorithm, sending 1.5n bits while electing a leader in a chain of even length n, is optimal, in the case when n is known to the processors. For both problems, absolutely exact bounds are found. Moreover, the lower bound proofs show that there is no optimal algorithm other than the suggested one(s).

Original languageEnglish
Pages (from-to)115-126
Number of pages12
JournalLecture Notes in Computer Science
Volume3499
DOIs
StatePublished - 1 Jan 2005
Event12 International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005 - Mont Saint-Michel, France
Duration: 24 May 200526 May 2005

Fingerprint

Dive into the research topics of 'Two absolute bounds for distributed bit complexity'. Together they form a unique fingerprint.

Cite this