Self-stabilizing weak leader election in anonymous trees using constant memory per edge (Q4598937)
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: Self-stabilizing weak leader election in anonymous trees using constant memory per edge |
scientific article; zbMATH DE number 6819512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Self-stabilizing weak leader election in anonymous trees using constant memory per edge |
scientific article; zbMATH DE number 6819512 |
Statements
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge (English)
0 references
15 December 2017
0 references
self-stabilization
0 references
weak leader election
0 references
anonymous tree
0 references
message passing
0 references
intermittent faults
0 references
0.8658977746963501
0 references
0.8406183123588562
0 references
0.8303890228271484
0 references
0.8276248574256897
0 references
0.8267470598220825
0 references
