Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Electing a leader in a synchronous ring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the message complexity of distributed problems / rank | |||
Normal rank | |||
Latest revision as of 09:45, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal lower bounds for some distributed algorithms for a complete network of processors |
scientific article |
Statements
Optimal lower bounds for some distributed algorithms for a complete network of processors (English)
0 references
1989
0 references
distributed algorithms
0 references
lower bounds
0 references
complete network of
0 references
processors
0 references
leader election problem
0 references
