On the complexity of universal leader election (Q5176087)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6410073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of universal leader election |
scientific article; zbMATH DE number 6410073 |
Statements
On the complexity of universal leader election (English)
0 references
2 March 2015
0 references
distributed algorithm
0 references
leader election
0 references
lower bound
0 references
0.9975212812423706
0 references
0.8900732398033142
0 references
0.8668390512466431
0 references
