The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (Q916352): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An <i>O</i> (log <i>n</i> ) expected rounds randomized byzantine generals protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneity is harder than 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: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank

Revision as of 09:49, 21 June 2024

scientific article
Language Label Description Also known as
English
The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
scientific article

    Statements

    The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    randomized algorithms
    0 references
    distributed computing
    0 references
    Byzantine Agreement
    0 references