Bounded cost algorithms for multivalued consensus using binary consensus instances (Q989554): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Failure Detection and Randomization: A Hybrid Approach to Solve Consensus / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Impossibility of distributed consensus with one faulty process / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: From binary consensus to multivalued consensus in asynchronous message-passing systems / rank | |||
Normal rank | |||
Revision as of 02:21, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded cost algorithms for multivalued consensus using binary consensus instances |
scientific article |
Statements
Bounded cost algorithms for multivalued consensus using binary consensus instances (English)
0 references
20 August 2010
0 references
distributed computing
0 references
fault tolerance
0 references
binary consensus
0 references
multivalued consensus
0 references
