Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
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: Defining liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Step and Namespace Complexity of Renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological perspective on distributed network algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New combinatorial topology bounds for renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MinMax algorithms for stabilizing consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of oblivious message adversaries for which consensus is solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals strike again / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and common knowledge in a Byzantine environment: Crash failures / 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: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5498755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Data Aggregation in Directed Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Layered Analysis of Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Characterization of Consensus under General Message Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Message-Passing Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agreement in synchronous networks with ubiquitous faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Consensus in Directed Graphs / rank
 
Normal rank

Revision as of 03:57, 1 August 2024

scientific article; zbMATH DE number 7687221
Language Label Description Also known as
English
Synchronous \(t\)-resilient consensus in arbitrary graphs
scientific article; zbMATH DE number 7687221

    Statements

    Synchronous \(t\)-resilient consensus in arbitrary graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2023
    0 references
    crash failures
    0 references
    consensus
    0 references
    combinatorial topology
    0 references
    distributed graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers