On the Complexity of Universal Leader Election (Q5501952)
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: On the Complexity of Universal Leader Election |
scientific article; zbMATH DE number 6472766
| 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 6472766 |
Statements
On the Complexity of Universal Leader Election (English)
0 references
14 August 2015
0 references
leader election
0 references
distributed algorithm
0 references
lower bound
0 references
0 references
0 references
0 references
0.86718166
0 references
0.8610893
0 references
0.8605444
0 references
0 references
0 references
0.85352206
0 references
0.8510346
0 references
0.8476735
0 references
