The Bit Complexity of Randomized Leader Election on a Ring (Q3829068): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:01, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
