Byzantine renaming in synchronous systems with \(t < N\) (Q5176096)
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 6410092
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Byzantine renaming in synchronous systems with \(t < N\) |
scientific article; zbMATH DE number 6410092 |
Statements
Byzantine renaming in synchronous systems with t < N (English)
0 references
2 March 2015
0 references
Byzantine failures
0 references
randomized algorithms
0 references
renaming problem
0 references
synchronous message passing model
0 references
0.9087986350059508
0 references
0.9045170545578004
0 references
0.8836493492126465
0 references
0.8486729264259338
0 references
0.8192306160926819
0 references
