On the average communication complexity of asynchronous distributed algorithms (Q4369868)
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 1103533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the average communication complexity of asynchronous distributed algorithms |
scientific article; zbMATH DE number 1103533 |
Statements
On the average communication complexity of asynchronous distributed algorithms (English)
0 references
2 February 1998
0 references
asynchronous distributed algorithms
0 references
communication complexity
0 references
0.9162979
0 references
0.9155545
0 references
0.9112654
0 references
0.90356195
0 references
0.89532954
0 references
