The space complexity of leader election in anonymous networks (Q3569285)
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 space complexity of leader election in anonymous networks |
scientific article; zbMATH DE number 5723435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The space complexity of leader election in anonymous networks |
scientific article; zbMATH DE number 5723435 |
Statements
THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKS (English)
0 references
18 June 2010
0 references
distributed computing
0 references
anonymous networks
0 references
leader election problem
0 references
space complexity
0 references
0.8383486866950989
0 references
0.8369861245155334
0 references
0.820334255695343
0 references
0.810905396938324
0 references
0.8039283156394958
0 references
