On the complexity of asynchronous agreement against powerful adversaries (Q901869)
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: On the complexity of asynchronous agreement against powerful adversaries |
scientific article; zbMATH DE number 6410099
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of asynchronous agreement against powerful adversaries |
scientific article; zbMATH DE number 6410099 |
Statements
On the complexity of asynchronous agreement against powerful adversaries (English)
0 references
6 January 2016
0 references
2 March 2015
0 references
consensus
0 references
randomized algorithms
0 references
0 references
0 references
