Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions (Q5401428)
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: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions |
scientific article; zbMATH DE number 6269583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions |
scientific article; zbMATH DE number 6269583 |
Statements
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions (English)
0 references
13 March 2014
0 references
atomic
0 references
bounded
0 references
Byzantine
0 references
fault tolerance
0 references
information theoretic
0 references
replication
0 references
wait-free
0 references
0.9999999
0 references
0.90954316
0 references
0.90522045
0 references
0.89494735
0 references
0 references
0.8848567
0 references
0.8777185
0 references
0.87754625
0 references
