Pages that link to "Item:Q3578204"

The following pages link to Tight failure detection bounds on atomic object implementations (Q3578204):

Displaying 15 items.

• Efficient test \& set constructions for faulty shared memory (Q287031) (← links)
• Anonymous asynchronous systems: the case of failure detectors (Q360279) (← links)
• The weakest failure detector to implement a register in asynchronous systems with hybrid communication (Q392012) (← links)
• On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (Q555307) (← links)
• On set consensus numbers (Q661057) (← links)
• The minimum information about failures for solving non-local tasks in message-passing systems (Q661069) (← links)
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems (Q990136) (← links)
• The cost of graceful degradation for omission failures (Q1606987) (← links)
• The weakest failure detector for eventual consistency (Q2010607) (← links)
• Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems (Q2868653) (← links)
• A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling (Q3460730) (← links)
• Error recovery points management for dynamically identified recoverable atomic actions (Q3816003) (← links)
• (Q4762647) (← links)
• What Can be Computed in a Distributed System? (Q5170751) (← links)
• Wait-freedom with advice (Q5918242) (← links)