A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement (Q6202204)
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: A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement |
scientific article; zbMATH DE number 7824299
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement |
scientific article; zbMATH DE number 7824299 |
Statements
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement (English)
0 references
26 March 2024
0 references
approximate agreement
0 references
combinatorial topology
0 references
consensus
0 references
distributed algorithms
0 references
lower bounds
0 references
