A reduction theorem for randomized distributed algorithms under weak adversaries (Q2234073)
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: A reduction theorem for randomized distributed algorithms under weak adversaries |
scientific article; zbMATH DE number 7410641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A reduction theorem for randomized distributed algorithms under weak adversaries |
scientific article; zbMATH DE number 7410641 |
Statements
A reduction theorem for randomized distributed algorithms under weak adversaries (English)
0 references
18 October 2021
0 references
communication closure
0 references
reduction
0 references
distributed algorithms
0 references
randomized consensus
0 references
weak adversaries
0 references
parameterized verification
0 references
0 references
0.89831614
0 references
0.8824974
0 references
0.8824974
0 references
0.8711644
0 references
0 references
0 references
0.8637142
0 references
0.8588528
0 references
