Pages that link to "Item:Q5501514"
From MaRDI portal
The following pages link to The weakest failure detectors to solve certain fundamental problems in distributed computing (Q5501514):
Displayed 15 items.
- Anonymous asynchronous systems: the case of failure detectors (Q360279) (← links)
- On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (Q555307) (← links)
- The minimum information about failures for solving non-local tasks in message-passing systems (Q661069) (← links)
- Managed agreement: generalizing two fundamental distributed agreement problems (Q845930) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links (Q990091) (← links)
- A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems (Q990136) (← links)
- Asynchronous bounded lifetime failure detectors (Q1041728) (← links)
- Practically-self-stabilizing virtual synchrony (Q1635506) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- Failure detectors encapsulate fairness (Q1938374) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- On implementing omega in systems with weak reliability and synchrony assumptions (Q2377261) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- Wait-freedom with advice (Q5918242) (← links)