Fast perfect-information leader-election protocols with linear immunity

DOI10.1007/BF01299739zbMath0833.68014MaRDI QIDQ1900182

Jason Cooper, Nathan Linial

Publication date: 17 October 1995

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

leader election protocol

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

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

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