Total ordering algorithms for asynchronous Byzantine systems (Q6084560): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/bfb0022151 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Optimal amortized distributed consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus algorithms with one-bit messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous byzantine agreement protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous consensus and broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable failure detectors for asynchronous systems (preliminary version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detector for solving consensus / 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: Time, clocks, and the ordering of events in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Fault-Tolerant Total Ordering Algorithms / 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
Property / DOI
 
Property / DOI: 10.1007/BFB0022151 / rank
 
Normal rank

Latest revision as of 18:17, 30 December 2024

scientific article; zbMATH DE number 7772997
Language Label Description Also known as
English
Total ordering algorithms for asynchronous Byzantine systems
scientific article; zbMATH DE number 7772997

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references