Pages that link to "Item:Q4371681"
From MaRDI portal
The following pages link to The weakest failure detector for solving consensus (Q4371681):
Displaying 50 items.
- From binary consensus to multivalued consensus in asynchronous message-passing systems (Q294742) (← links)
- A distributed leader election algorithm in crash-recovery and omissive systems (Q344564) (← 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)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- Using asynchrony and zero degradation to speed up indulgent consensus protocols (Q436832) (← links)
- Communication-optimal eventually perfect failure detection in partially synchronous systems (Q473190) (← links)
- The impossibility of boosting distributed service resilience (Q550250) (← links)
- On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (Q555307) (← links)
- The disagreement power of an adversary (Q661056) (← links)
- On set consensus numbers (Q661057) (← links)
- The minimum information about failures for solving non-local tasks in message-passing systems (Q661069) (← links)
- Implementing unreliable failure detectors with unknown membership (Q845828) (← links)
- Managed agreement: generalizing two fundamental distributed agreement problems (Q845930) (← links)
- A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems (Q848847) (← links)
- Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks (Q897385) (← links)
- The gap in circumventing the impossibility of consensus (Q931725) (← 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 and communication-efficient omega algorithm in the crash-recovery model (Q990113) (← links)
- A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems (Q990136) (← links)
- Adaptive progress: a gracefully-degrading liveness property (Q992505) (← links)
- Anti-\(\Omega \): the weakest failure detector for set agreement (Q992506) (← links)
- Implementing the Omega failure detector in the crash-recovery failure model (Q1004284) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Asynchronous bounded lifetime failure detectors (Q1041728) (← links)
- Reducing \(\Omega\) to \(\lozenge\mathcal W\) (Q1274736) (← links)
- Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks (Q1292422) (← links)
- On modelling mobility (Q1575151) (← links)
- Revisiting the PAXOS algorithm (Q1575634) (← links)
- On the hardness of failure-sensitive agreement problems. (Q1603446) (← links)
- Practically-self-stabilizing virtual synchrony (Q1635506) (← links)
- In search of lost time (Q1675756) (← links)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- A flexible formal framework for masking/demasking faults (Q1827146) (← links)
- Consensus in Byzantine asynchronous systems (Q1827288) (← links)
- Byzantine-resistant total ordering algorithms. (Q1854265) (← links)
- A necessary and sufficient condition for transforming limited accuracy failure detectors (Q1878682) (← links)
- Abstractions for fault-tolerant global computing (Q1881258) (← links)
- Partial synchrony based on set timeliness (Q1938365) (← links)
- Failure detectors encapsulate fairness (Q1938374) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Communication-efficient and crash-quiescent omega with unknown membership (Q1944072) (← links)
- A knowledge-theoretic analysis of uniform distributed coordination and failure detectors (Q1953242) (← links)
- Active disk Paxos with infinitely many processes (Q1953639) (← links)
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors (Q1953644) (← links)
- On the importance of having an identity or, is consensus really universal? (Q1953645) (← links)
- The weakest failure detector to solve nonuniform consensus (Q1954210) (← links)
