The Bit Complexity of Randomized Leader Election on a Ring

DOI10.1137/0218002zbMath0674.68029OpenAlexW2077204293MaRDI QIDQ3829068

No author found.

Publication date: 1989

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

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

zbMATH Keywords

complexitylower boundsrandomized algorithmscommunication complexityattritionleader electionasynchronous distributed computationprocessor ringssolitude verification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of computing (68Q99)

Related Items (4)

Randomized function evaluation on a ring ⋮ Hundreds of impossibility results for distributed computing ⋮ Anonymous wireless rings ⋮ New lower bound techniques for distributed leader finding and other problems on rings of processors

This page was built for publication: The Bit Complexity of Randomized Leader Election on a Ring