This paper answers two questions on Leader Election, which remained there open. The first is to close the gap between the known upper and lower bounds.

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 ...

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied the bit complexity of Consensus and ...

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).

They studied the bit complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader Election, ...

They studied the bit complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader Election, ...

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).

Bibliographic details on Two absolute bounds for distributed bit complexity.

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

20 Lower & Upper bound An upper bound must be valid for all inputs and all schedulers. To obtain a lower bound L, however, it is sufficient to show that, for ...