Tolerating Random Byzantine Failures in an Unbounded Network (Q4598913)
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 6819480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tolerating Random Byzantine Failures in an Unbounded Network |
scientific article; zbMATH DE number 6819480 |
Statements
Tolerating Random Byzantine Failures in an Unbounded Network (English)
0 references
15 December 2017
0 references
Byzantine failures
0 references
reliable communication
0 references
distributed computing
0 references
random failures
0 references
scalability
0 references
grid
0 references
0.88257766
0 references
0 references
0.8797047
0 references
0.87901235
0 references
0.87670064
0 references
0.8740221
0 references
