A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:11, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors |
scientific article |
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