The Bit Complexity of Randomized Leader Election on a Ring
From MaRDI portal
Publication:3829068
DOI10.1137/0218002zbMath0674.68029MaRDI 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
complexity; lower bounds; randomized algorithms; communication complexity; attrition; leader election; asynchronous distributed computation; processor rings; solitude verification
Related Items
Anonymous wireless rings, New lower bound techniques for distributed leader finding and other problems on rings of processors, Randomized function evaluation on a ring