The Do-All problem with Byzantine processor failures (Q1770376)
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: The Do-All problem with Byzantine processor failures |
scientific article; zbMATH DE number 2153175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Do-All problem with Byzantine processor failures |
scientific article; zbMATH DE number 2153175 |
Statements
The Do-All problem with Byzantine processor failures (English)
0 references
6 April 2005
0 references
Distributed cooperation
0 references
Independent tasks
0 references
Byzantine failures
0 references
Work complexity
0 references
0 references
0.87769634
0 references
0.87404156
0 references
0.86866105
0 references
0 references
0.86544275
0 references
0 references
0.86086047
0 references
