Two lower bounds in asynchronous distributed computation (Q808249)
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: Two lower bounds in asynchronous distributed computation |
scientific article; zbMATH DE number 4209592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two lower bounds in asynchronous distributed computation |
scientific article; zbMATH DE number 4209592 |
Statements
Two lower bounds in asynchronous distributed computation (English)
0 references
1991
0 references
lower bounds
0 references
message complexity
0 references
distributed computation
0 references
bidirectional ring of n anonymous processors
0 references
0.8663351535797119
0 references
0.8521530628204346
0 references
0.8466752767562866
0 references
0.8400227427482605
0 references
0.8332537412643433
0 references
