How to elect a leader faster than a tournament (Q2796273)
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: How to elect a leader faster than a tournament |
scientific article; zbMATH DE number 6560078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to elect a leader faster than a tournament |
scientific article; zbMATH DE number 6560078 |
Statements
23 March 2016
0 references
asynchronous
0 references
leader election
0 references
lower bound
0 references
message complexity
0 references
message-passing
0 references
randomized algorithms
0 references
How to elect a leader faster than a tournament (English)
0 references
