Fast perfect-information leader-election protocols with linear immunity
From MaRDI portal
Publication:1900182
DOI10.1007/BF01299739zbMath0833.68014MaRDI QIDQ1900182
Publication date: 17 October 1995
Published in: Combinatorica (Search for Journal in Brave)
05C90: Applications of graph theory
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
Perfect information leader election in \(\log^*n+O(1)\) rounds, Stochastic coalescence in logarithmic time, Secure multi-party computation in large networks, Optimal Impartial Selection
Cites Work