Pages that link to "Item:Q1660951"
From MaRDI portal
The following pages link to Asynchronous computability theorems for \(t\)-resilient systems (Q1660951):
Displaying 8 items.
- An algorithmic approach to the asynchronous computability theorem (Q1616400) (← links)
- A characterization of \(t\)-resilient colorless task anonymous solvability (Q1713909) (← links)
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
- An axiomatic approach to computing the connectivity of synchronous and asynchronous systems (Q2810958) (← links)
- Schlegel Diagram and Optimizable Immediate Snapshot Protocol (Q3300823) (← links)
- Toward a Topological Characterization of Asynchronous Complexity (Q3434995) (← links)
- Brief announcement: On decidability of 2-process affine models (Q6535053) (← links)
- Defining logical obstruction with fixpoints in epistemic logic (Q6645916) (← links)