The Bit Complexity of Randomized Leader Election on a Ring
From MaRDI portal
Publication:3829068
DOI10.1137/0218002zbMATH Open0674.68029OpenAlexW2077204293MaRDI QIDQ3829068FDOQ3829068
Author name not available (Why is that?)
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
complexityrandomized algorithmslower boundsattritionleader electioncommunication complexityasynchronous distributed computationprocessor ringssolitude verification
Cited In (10)
- Bit-optimal election in synchronous rings
- Randomized function evaluation on a ring
- Hundreds of impossibility results for distributed computing
- Tight lower bounds for probabilistic solitude verification on anonymous rings
- Title not available (Why is that?)
- The topology of randomized symmetry-breaking distributed computing
- Title not available (Why is that?)
- On the bit complexity of distributed computations in a ring with a leader
- Anonymous wireless rings
- New lower bound techniques for distributed leader finding and other problems on rings of processors
Recommendations
- Title not available (Why is that?) 👍 👎
- On the bit complexity of distributed computations in a ring with a leader 👍 👎
- Improved bounds for electing a leader in a synchronous ring 👍 👎
- Deterministic, constant space, self-stabilizing leader election on uniform rings 👍 👎
- Sublinear bounds for randomized leader election 👍 👎
- Sublinear bounds for randomized leader election 👍 👎
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings 👍 👎
- The complexity of leader election in diameter-two networks 👍 👎
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative 👍 👎
This page was built for publication: The Bit Complexity of Randomized Leader Election on a Ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829068)
