Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links (Q5137014)
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 7279511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links |
scientific article; zbMATH DE number 7279511 |
Statements
Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links (English)
0 references
30 November 2020
0 references
distributed algorithms
0 references
Byzantine agreement
0 references
faulty channels
0 references
asynchronous networks
0 references
fault-tolerant computing
0 references
0 references
0.864767849445343
0 references
0.8150700926780701
0 references
0.7930867075920105
0 references
0.7905584573745728
0 references
0.7899810671806335
0 references
