New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701)
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: New lower bound techniques for distributed leader finding and other problems on rings of processors |
scientific article; zbMATH DE number 4211500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New lower bound techniques for distributed leader finding and other problems on rings of processors |
scientific article; zbMATH DE number 4211500 |
Statements
New lower bound techniques for distributed leader finding and other problems on rings of processors (English)
0 references
1991
0 references
leader election
0 references
asynchronous ring of processors
0 references
distributed algorithm
0 references
lower bound
0 references
randomized algorithms
0 references
0 references
0 references
0.8663351535797119
0 references
0.8657844662666321
0 references
0.8491755723953247
0 references
0.8312270045280457
0 references
