Consensus in the presence of mortal Byzantine faulty processes (Q424903): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-011-0147-3 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-011-0147-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167979110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform consensus is harder than consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fault-tolerant agreement algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy impossibility proofs for distributed consensus problems / 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: Unreliable failure detectors for reliable distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early stopping in Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of distributed programs into communication-closed layers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous consensus and broadcast protocols / 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: Distributed agreement in the presence of processor and communication faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals strike again / rank
 
Normal rank
Property / cites work
 
Property / cites work: From partial consistency to global broadcast / 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: Low complexity Byzantine-resilient consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3045849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hybrid fault models for asynchronous approximate agreement / 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: In search of lost time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus in Byzantine asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Byzantine Fault Detectors for Solving Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: From binary consensus to multivalued consensus in asynchronous message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded cost algorithms for multivalued consensus using binary consensus instances / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-011-0147-3 / rank
 
Normal rank

Latest revision as of 17:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Consensus in the presence of mortal Byzantine faulty processes
scientific article

    Statements

    Consensus in the presence of mortal Byzantine faulty processes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 June 2012
    0 references
    consensus
    0 references
    Byzantine fault
    0 references
    distributed algorithm
    0 references
    fault tolerance
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers