On the complexity of computation in the presence of link failures: The case of a ring (Q808251)
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 4209594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computation in the presence of link failures: The case of a ring |
scientific article; zbMATH DE number 4209594 |
Statements
On the complexity of computation in the presence of link failures: The case of a ring (English)
0 references
1991
0 references
ring configuration
0 references
lower bounds
0 references
message complexity
0 references
link failures
0 references
0 references
0.848056972026825
0 references
0.824539065361023
0 references
0.8214254379272461
0 references
0.7914914488792419
0 references
0.7879628539085388
0 references
