Consensus algorithms with one-bit messages (Q757011): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound for the time to assure interactive consistency / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reaching Agreement in the Presence of Faults / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Distributed Agreement / rank | |||
Normal rank | |||
Latest revision as of 15:24, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Consensus algorithms with one-bit messages |
scientific article |
Statements
Consensus algorithms with one-bit messages (English)
0 references
1991
0 references
fault tolerance
0 references
one-bit messages
0 references
Consensus Problem
0 references
