Iterative approximate Byzantine consensus in arbitrary directed graphs (Q2933813)
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: Iterative approximate Byzantine consensus in arbitrary directed graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative approximate Byzantine consensus in arbitrary directed graphs |
scientific article |
Statements
Iterative approximate byzantine consensus in arbitrary directed graphs (English)
0 references
5 December 2014
0 references
Byzantine faults
0 references
consensus
0 references
iterative algorithms
0 references
0.875200629234314
0 references
0.859569251537323
0 references
0.848983645439148
0 references
0.8345671892166138
0 references
0.813357949256897
0 references
