On the message complexity of distributed problems (Q3345763)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3880094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the message complexity of distributed problems |
scientific article; zbMATH DE number 3880094 |
Statements
On the message complexity of distributed problems (English)
0 references
1984
0 references
distributed algorithms
0 references
asynchronous message-passing systems
0 references
local topological information
0 references
distributed computing
0 references
extrema-finding
0 references
minimum- weight spanning-tree construction
0 references
0 references
0 references
0.814738392829895
0 references
0.8138838410377502
0 references
0.8046822547912598
0 references
0.7988744378089905
0 references
