Pages that link to "Item:Q555307"
From MaRDI portal
The following pages link to On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (Q555307):
Displaying 11 items.
- The minimum information about failures for solving non-local tasks in message-passing systems (Q661069) (← links)
- Anti-\(\Omega \): the weakest failure detector for set agreement (Q992506) (← links)
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors (Q1953644) (← links)
- On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems (Q2868653) (← links)
- Anti-Ω (Q2934332) (← links)
- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach (Q3523203) (← links)
- Which broadcast abstraction captures \(k\)-set agreement? (Q6487500) (← links)
- A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus (Q6536339) (← links)
