Lower Bounds for Distributed Maximum-Finding Algorithms (Q3765249): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1634.1889 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001357803 / rank | |||
Normal rank | |||
Latest revision as of 23:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower Bounds for Distributed Maximum-Finding Algorithms |
scientific article |
Statements
Lower Bounds for Distributed Maximum-Finding Algorithms (English)
0 references
1984
0 references
distributed algorithms
0 references
message complexity
0 references
communication rings
0 references
election algorithms
0 references
lower bounds
0 references
number of messages
0 references
maximum label in a circular configuration of n labeled processes
0 references
