The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (Q916352)
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: Publication:916352 |
scientific article; zbMATH DE number 4153864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols |
scientific article; zbMATH DE number 4153864 |
Statements
The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (English)
0 references
1990
0 references
randomized algorithms
0 references
distributed computing
0 references
Byzantine Agreement
0 references
0.8387935161590576
0 references
0.8258140683174133
0 references
0.825745701789856
0 references
0.8053813576698303
0 references
0.8009413480758667
0 references
