SIAM Journal on Computing · 2000 · 22 citations · 13 references
ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsDistributed ComputingFault Tolerance In CommunicationFault-tolerant CommunicationLeader ElectionReliable Distributed SystemsReliable System DesignDistributed Leader ElectionFault-tolerant Consensus ProtocolsFault-tolerant Distributed AlgorithmsFault-tolerant Distributed SystemsFault-tolerant Leader ElectionLeader Election Under FailureResilient Distributed Systems
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.
13
Michael Ben-Or, Nathan Linial · 1989 · 200 citations
Randomization in Byzantine Agreement.
Benny Chor, Cynthia Dwork · Medical Entomology and Zoology · 1989 · 119 citations
Game-theoretic aspects of computing
Nathan Linial · RePEc: Research Papers in Economics · 1994 · 65 citations