Pages that link to "Item:Q3830798"
From MaRDI portal
The following pages link to Simple constant-time consensus protocols in realistic failure models (Q3830798):
Displayed 10 items.
- Simultaneity is harder than agreement (Q757014) (← links)
- Transaction commit in a realistic timing model (Q913533) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (Q4031320) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Brief Announcement: Improved Consensus in Quantum Networks (Q6202264) (← links)
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication (Q6202273) (← links)