A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:14, 5 March 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
    0 references
    1988
    0 references
    0 references
    message complexity
    0 references
    distributed computing
    0 references
    lower bound
    0 references
    leader finding on rings of processors
    0 references