An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
From MaRDI portal
Publication:2810958
DOI10.1016/j.entcs.2009.02.018zbMath1339.68307OpenAlexW2091289286MaRDI QIDQ2810958
Sergio Rajsbaum, Mark R. Tuttle, Maurice P. Herlihy
Publication date: 6 June 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.018
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (5)
The topology of distributed adversaries ⋮ Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Impure Simplicial Complexes: Complete Axiomatization ⋮ Why Extension-Based Proofs Fail ⋮ A topological perspective on distributed network algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Layered Analysis of Consensus
- Unifying synchronous and asynchronous message-passing models
- Round-by-round fault detectors (extended abstract)
- Tight bounds for k -set agreement
- The Combinatorial Structure of Wait-Free Solvable Tasks
- The topological structure of asynchronous computability
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Algebraic spans
- Shellable Nonpure Complexes and Posets. I
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Set consensus using arbitrary objects (preliminary version)
- The Synchronous Condition-Based Consensus Hierarchy
- Distributed Computing
This page was built for publication: An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
