Two lower bounds in asynchronous distributed computation (Q808249): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Pavol Ďuriš / rank
 
Normal rank
Property / author
 
Property / author: Zvi Galil / rank
 
Normal rank

Revision as of 14:53, 17 February 2024

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