Two lower bounds in asynchronous distributed computation (Q808249)

From MaRDI portal
Revision as of 18:15, 21 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two lower bounds in asynchronous distributed computation
scientific article

    Statements

    Two lower bounds in asynchronous distributed computation (English)
    0 references
    1991
    0 references
    0 references
    lower bounds
    0 references
    message complexity
    0 references
    distributed computation
    0 references
    bidirectional ring of n anonymous processors
    0 references
    0 references
    0 references