The complexity of leader election in diameter-two networks (Q1988528)
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 complexity of leader election in diameter-two networks |
scientific article; zbMATH DE number 7192811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of leader election in diameter-two networks |
scientific article; zbMATH DE number 7192811 |
Statements
The complexity of leader election in diameter-two networks (English)
0 references
23 April 2020
0 references
distributed algorithm
0 references
leader election
0 references
randomized algorithm
0 references
message complexity
0 references
time complexity
0 references
lower bound
0 references
0 references
0 references
