Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Towards worst-case churn resistant peer-to-peer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast byzantine agreement in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated consensus in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computing and networking. 14th international conference, ICDCN 2013, Mumbai, India, January 3--6, 2013. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time is not a healer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-by-round fault detectors (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Heard-Of model: computing in distributed systems with benign faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous consensus under hybrid process and link failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility Results and Lower Bounds for Consensus under Link Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Dynamic Networks Where Consensus Is Solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus in rooted dynamic networks with short-lived stability / 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: Fault Tolerance in Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / 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: Distributed agreement in the presence of processor and communication faults / 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: Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / 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: On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The birth of the giant component / 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: The weakest failure detectors to solve certain fundamental problems in distributed computing / rank
 
Normal rank

Revision as of 11:23, 15 July 2024

scientific article
Language Label Description Also known as
English
Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
scientific article

    Statements

    Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 April 2018
    0 references
    directed dynamic networks
    0 references
    consensus
    0 references
    \(k\)-set agreement
    0 references
    message adversaries
    0 references
    impossibility results
    0 references
    lower bounds
    0 references
    failure detectors
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references