Optimal algorithms for synchronous Byzantine \(k\)-set agreement (Q6093586)
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: Optimal algorithms for synchronous Byzantine k-set agreement |
scientific article; zbMATH DE number 7735134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for synchronous Byzantine \(k\)-set agreement |
scientific article; zbMATH DE number 7735134 |
Statements
Optimal algorithms for synchronous Byzantine \(k\)-set agreement (English)
0 references
7 September 2023
0 references
agreement problem
0 references
Byzantine processes
0 references
distributed algorithm
0 references
distributed computability
0 references
\(k\)-set agreement
0 references
message-passing
0 references
round-based algorithm
0 references
synchronous system
0 references
0 references
0.9681635499000548
0 references
0.8656513094902039
0 references
0.8506505489349365
0 references
0.8474376797676086
0 references
0.8456383943557739
0 references
