A self-adjusting algorithm for Byzantine agreement (Q1189860): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Stabilization and pseudo-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals strike again / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for byzantine agreement without authentication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on information exchange for Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching approximate agreement in the presence of faults / 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: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02277668 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036850022 / rank
 
Normal rank

Latest revision as of 10:50, 30 July 2024

scientific article
Language Label Description Also known as
English
A self-adjusting algorithm for Byzantine agreement
scientific article

    Statements

    A self-adjusting algorithm for Byzantine agreement (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    distributed systems
    0 references
    fault tolerance
    0 references
    self-adjusting algorithm
    0 references
    Byzantine agreement
    0 references
    0 references