A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315)
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: A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors |
scientific article; zbMATH DE number 4064483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors |
scientific article; zbMATH DE number 4064483 |
Statements
A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (English)
0 references
1988
0 references
message complexity
0 references
distributed computing
0 references
lower bound
0 references
leader finding on rings of processors
0 references
0 references
