Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions (Q6659191)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7963725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions |
scientific article; zbMATH DE number 7963725 |
Statements
Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions (English)
0 references
8 January 2025
0 references
Byzantine consensus
0 references
asynchronous distributed algorithms
0 references
cyber-security
0 references
multi-hop communication
0 references
0 references
0 references
0 references
0 references
0 references
0.7969592213630676
0 references
0.7884583473205566
0 references
0.786364734172821
0 references
0.7834578156471252
0 references
0.7808974981307983
0 references
