The following pages link to (Q5137358):
Displaying 24 items.
- Implementing set objects in dynamic distributed systems (Q269463) (← links)
- A protocol for implementing Byzantine storage in churn-prone distributed systems (Q391995) (← links)
- Wait-free regular storage from Byzantine components (Q845896) (← links)
- Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register (Q1686114) (← links)
- Byzantine quorum systems with maximum availability. (Q1853046) (← links)
- Probabilistic quorum systems (Q1854466) (← links)
- Diffusion without false rumors: On propagating updates in a Byzantine environment. (Q1874396) (← links)
- The sum of its parts: analysis of federated Byzantine agreement systems (Q2084977) (← links)
- Asynchronous reconfiguration with Byzantine failures (Q2104034) (← links)
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps (Q2110369) (← links)
- Two quantum secret sharing schemes with adversary structure (Q2165333) (← links)
- Byzantine disk paxos: optimal resilience with Byzantine shared memory (Q2375303) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- Hardening Cassandra against Byzantine failures (Q3300830) (← links)
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory (Q3540237) (← links)
- (Q4904139) (← links)
- (Q5091091) (← links)
- Secure reliable multicast protocols in a WAN (Q5137892) (← links)
- Synchronous Byzantine quorum systems (Q5137894) (← links)
- Access cost for asynchronous Byzantine quorum systems (Q5138348) (← links)
- Distributed Computing (Q5395165) (← links)
- Permissionless and asynchronous asset transfer (Q6096037) (← links)
- Asynchronous reconfiguration with Byzantine failures (Q6535026) (← links)
- Asymmetric distributed trust (Q6601210) (← links)
