The Bit Complexity of Randomized Leader Election on a Ring (Q3829068): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0218002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077204293 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:47, 19 March 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
