Two lower bounds in asynchronous distributed computation (Q808249): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computing on an anonymous ring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3769937 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower Bounds for Distributed Maximum-Finding Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) Unidirectional Algorithm for the Circular Extrema Problem / rank | |||
Normal rank |
Revision as of 18:15, 21 June 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
lower bounds
0 references
message complexity
0 references
distributed computation
0 references
bidirectional ring of n anonymous processors
0 references