scientific article; zbMATH DE number 7407798

MaRDI QIDQ5155689

Adam Shimi, Aurélie Hurault, Philippe Quéinnec

Publication date: 8 October 2021

Full work available at URL: https://arxiv.org/abs/2011.12879

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

failuresasynchronous roundsheard-of modelmessage-passing models

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items

Derivation of Heard-of Predicates from Elementary Behavioral Patterns

Uses Software

• PSync

Cites Work

• Unnamed Item
• Decomposition of distributed programs into communication-closed layers
• A lower bound for the time to assure interactive consistency
• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
• Cutoff bounds for consensus algorithms
• A characterization of oblivious message adversaries for which consensus is solvable
• The Heard-Of model: computing in distributed systems with benign faults
• Round-by-round fault detectors (extended abstract)
• PSync: a partially synchronous language for fault-tolerant distributed algorithms
• The Complexity of Data Aggregation in Directed Networks
• The topological structure of asynchronous computability
• Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• The weakest failure detector for solving consensus
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Derivation of Heard-of Predicates from Elementary Behavioral Patterns
• Time is not a healer
• Topological Characterization of Consensus under General Message Adversaries
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Towards a complexity theory for local distributed computing