Agreement in synchronous networks with ubiquitous faults (Q2382676): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5137898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound for randomized synchronous consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agreement in the presence of faults, on networks of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in synchronous networks with dynamic faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient broadcasting with linearly bounded faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic broadcast: From simple message diffusion to Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in hypercubes and star graphs with dynamic faults. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing input multiplicity in anonymous synchronous networks with dynamic faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal broadcasting in hypercubes with dynamic faults / 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: Fault Tolerance in Networks of Bounded Degree / 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: Easy impossibility proofs for distributed consensus problems / 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: Broadcasting in a hypercube when some calls fail / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Byzantine Agreement for <i>n</i> &gt; 3<i>t</i> Processors in <i>t</i> + 1 Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting with linearly bounded transmission faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Layered Analysis of Consensus / 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: Distributed agreement in the presence of processor and communication faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time is not a healer / rank
 
Normal rank

Latest revision as of 10:24, 27 June 2024

scientific article
Language Label Description Also known as
English
Agreement in synchronous networks with ubiquitous faults
scientific article

    Statements

    Agreement in synchronous networks with ubiquitous faults (English)
    0 references
    0 references
    0 references
    2 October 2007
    0 references
    Theory of distributed computation
    0 references
    synchronous systems
    0 references
    dynamic faults
    0 references
    mobile faults
    0 references
    transmission failure model
    0 references
    arbitrary network topology
    0 references
    agreement
    0 references
    majority
    0 references
    bivalency argument
    0 references
    limits to computability
    0 references
    0 references
    0 references

    Identifiers