Two lower bounds in asynchronous distributed computation (Q808249)

From MaRDI portal
Revision as of 12:06, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    1991
    0 references
    lower bounds
    0 references
    message complexity
    0 references
    distributed computation
    0 references
    bidirectional ring of n anonymous processors
    0 references

    Identifiers