The Bit Complexity of Randomized Leader Election on a Ring (Q3829068)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Bit Complexity of Randomized Leader Election on a Ring |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Bit Complexity of Randomized Leader Election on a Ring |
scientific article |
Statements
The Bit Complexity of Randomized Leader Election on a Ring (English)
0 references
1989
0 references
complexity
0 references
leader election
0 references
asynchronous distributed computation
0 references
randomized algorithms
0 references
processor rings
0 references
communication complexity
0 references
attrition
0 references
solitude verification
0 references
lower bounds
0 references
0.9191769
0 references
0.88456094
0 references
0.8820488
0 references
0.8791828
0 references
0.8791828
0 references
0.87576544
0 references
0.8740922
0 references
