An <i>O</i> (log <i>n</i> ) expected rounds randomized byzantine generals protocol (Q3768382)
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 4026809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An <i>O</i> (log <i>n</i> ) expected rounds randomized byzantine generals protocol |
scientific article; zbMATH DE number 4026809 |
Statements
An <i>O</i> (log <i>n</i> ) expected rounds randomized byzantine generals protocol (English)
0 references
1987
0 references
Byzantine generals algorithms
0 references
consensus protocols
0 references
distributed algorithms
0 references
fault tolerance
0 references
parallel algorithms
0 references
0.8346318602561951
0 references
0.8165749311447144
0 references
0.815248966217041
0 references
0.815248966217041
0 references
0.8114907145500183
0 references
