Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599)
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: Ordered and delayed adversaries and how to work against them on a shared channel |
scientific article; zbMATH DE number 7137731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordered and delayed adversaries and how to work against them on a shared channel |
scientific article; zbMATH DE number 7137731 |
Statements
Ordered and delayed adversaries and how to work against them on a shared channel (English)
0 references
27 November 2019
0 references
performing tasks
0 references
do-all
0 references
shared channel
0 references
multiple-access channel
0 references
ordered adversaries
0 references
delayed adversaries
0 references
crash failures
0 references
distributed algorithms
0 references
randomized algorithms
0 references
work complexity
0 references
time complexity
0 references
transmission energy complexity
0 references
0 references
0 references
0 references
0.8504498
0 references
0.8467763
0 references
0.8416575
0 references
0.8298271
0 references
0.82849133
0 references
0.8264344
0 references
0.82626027
0 references
0.82581574
0 references
