The do-all problem in broadcast networks (Q2787672)
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 in broadcast networks |
scientific article; zbMATH DE number 6550322
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The do-all problem in broadcast networks |
scientific article; zbMATH DE number 6550322 |
Statements
The do-all problem in broadcast networks (English)
0 references
4 March 2016
0 references
adversary
0 references
distributed algorithm
0 references
fail-stop failures
0 references
independent tasks
0 references
lower bound
0 references
multiple-access channel
0 references
0.8669021
0 references
0.86134714
0 references
0.8606553
0 references
0.86050725
0 references
0.86050725
0 references
0.85158217
0 references
0.8495077
0 references
0.84773576
0 references
