Lower Bounds for Distributed Maximum-Finding Algorithms (Q3765249)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3765249 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8521530628204346
0 references
0.8507043719291687
0 references
0.8467233777046204
0 references
0.8363029360771179
0 references
