Fully Polynomial Byzantine Agreement for <i>n</i> > 3<i>t</i> Processors in <i>t</i> + 1 Rounds (Q4388871)
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 1150636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully Polynomial Byzantine Agreement for <i>n</i> > 3<i>t</i> Processors in <i>t</i> + 1 Rounds |
scientific article; zbMATH DE number 1150636 |
Statements
Fully Polynomial Byzantine Agreement for <i>n</i> > 3<i>t</i> Processors in <i>t</i> + 1 Rounds (English)
0 references
10 May 1998
0 references
Byzantine agreement
0 references
consensus
0 references
distributed computing
0 references
fault tolerance
0 references
computer security
0 references
0.9249133
0 references
0.9231686
0 references
0.9149852
0 references
0.9138546
0 references
0 references
0.8955412
0 references
0.8933673
0 references
0.8933673
0 references
