Reaching approximate Byzantine consensus with multi-hop communication (Q5207895)
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: Reaching approximate Byzantine consensus with multi-hop communication |
scientific article; zbMATH DE number 7150665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reaching approximate Byzantine consensus with multi-hop communication |
scientific article; zbMATH DE number 7150665 |
Statements
Reaching Approximate Byzantine Consensus with Multi-hop Communication (English)
0 references
14 January 2020
0 references
approximate Byzantine consensus
0 references
iterative algorithm
0 references
synchronous system
0 references
incomplete network
0 references
bounded-length communication paths
0 references
0.9623675346374512
0 references
0.875200629234314
0 references
0.8148528337478638
0 references
0.8043451905250549
0 references
0.7912651300430298
0 references
