Fast perfect-information leader-election protocols with linear immunity

DOI10.1007/BF01299739zbMATH Open0833.68014MaRDI QIDQ1900182FDOQ1900182

Authors: Jason Cooper, Nathan Linial 

Publication date: 17 October 1995

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Fast leader-election protocols with bounded cheaters' edge
• Simple and efficient leader election in the full information model
• Perfect-Information Leader Election with Optimal Resilience

zbMATH Keywords

leader election protocol

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Cites Work

• Ramanujan graphs
• A Robust Noncryptographic Protocol for Collective Coin Flipping
• Coin-Flipping Games Immune against Linear-Sized Coalitions
• The influence of large coalitions

Cited In (4)

• Optimal Impartial Selection
• Stochastic coalescence in logarithmic time
• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Secure multi-party computation in large networks

This page was built for publication: Fast perfect-information leader-election protocols with linear immunity

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