Pages that link to "Item:Q1853174"
From MaRDI portal
The following pages link to A simple proof of the uniform consensus synchronous lower bound. (Q1853174):
Displaying 12 items.
- Message and time efficient consensus protocols for synchronous distributed systems (Q436769) (← links)
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
- A bivalency proof of the lower bound for uniform consensus (Q1044730) (← links)
- The inherent price of indulgence (Q1953640) (← links)
- The overhead of consensus failure recovery (Q1954212) (← links)
- Multi-shot distributed transaction commit (Q1981633) (← links)
- Unbeatable consensus (Q2121062) (← links)
- Synchronous condition-based consensus (Q2375299) (← links)
- Fast non-blocking atomic commit: an inherent trade-off (Q2390309) (← links)
- (Q5090904) (← links)
- Self-stabilizing indulgent zero-degrading binary consensus (Q6201321) (← links)
