Perfect-Information Leader Election with Optimal Resilience

DOI10.1137/S0097539796307182MaRDI QIDQ4943872zbMATH OpenFDO

Authors Ravi B. Boppana, Babu Narayanan

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539796307182

zbMATH Keywords

distributed computingfault toleranceleader electionperfect informationprobabilistic methods

Mathematics Subject Classification ID

Combinatorial probability (60C05) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Fast asynchronous Byzantine agreement and leader election with full information
• Leader election in the presence of n-1 initial failures
• Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
• Lower bounds for leader election and collective coin-flipping in the perfect information model

Cited in

(6)

• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Fast perfect-information leader-election protocols with linear immunity
• A distributed leader election algorithm in crash-recovery and omissive systems
• Byzantine agreement with optimal resilience via statistical fraud detection
• A tight lower bound on adaptively secure full-information coin flip
• A lower bound for adaptively-secure collective coin flipping protocols

This page was built for publication: Perfect-Information Leader Election with Optimal Resilience

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943872)