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 this page instead for the normal view: Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions |
scientific article; zbMATH DE number 7963725
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
