Perfect-Information Leader Election with Optimal Resilience

Ravi B. Boppana, Babu Narayanan

SIAM Journal on Computing · 2000 · 22 citations · 13 references

Concepts

Abstract

This paper investigates the leader-election problem in the perfect-information model of distributed computing. It is shown that for every $\epsilon < \half$, there exist leader-election protocols for n processors that tolerate $\eps n$ faults.

References

13