Perfect-Information Leader Election with Optimal Resilience

DOI10.1137/S0097539796307182zbMath0947.68170MaRDI QIDQ4943872

Babu Narayanan, Ravi B. Boppana

Publication date: 19 March 2000

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

zbMATH Keywords

fault tolerancedistributed computingprobabilistic methodsperfect informationleader election

Mathematics Subject Classification ID

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

Related Items (2)

A lower bound for adaptively-secure collective coin flipping protocols ⋮ Perfect information leader election in \(\log^*n+O(1)\) rounds

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