Pages that link to "Item:Q2375299"
From MaRDI portal
The following pages link to Synchronous condition-based consensus (Q2375299):
Displaying 21 items.
- No double discount: condition-based simultaneity yields limited gain (Q418187) (← links)
- Synchronous consensus under hybrid process and link failures (Q719299) (← links)
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
- Necessary and sufficient conditions for broadcast consensus protocols. (Q1312603) (← links)
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds (Q1606983) (← links)
- The overhead of consensus failure recovery (Q1954212) (← links)
- Unbeatable consensus (Q2121062) (← links)
- A layered analysis of consensus (Q2784490) (← links)
- BBUFs: synchronization mechanism (Q2918716) (← links)
- Communication Patterns and Input Patterns in Distributed Computing (Q3460703) (← links)
- How to Solve Consensus in the Smallest Window of Synchrony (Q3540219) (← links)
- Continuous Consensus with Failures and Recoveries (Q3540246) (← links)
- No Double Discount: Condition-Based Simultaneity Yields Limited Gain (Q3540247) (← links)
- Uniform consensus is harder than consensus (Q4818670) (← links)
- What Can be Computed in a Distributed System? (Q5170751) (← links)
- Narrowing Power vs. Efficiency in Synchronous Set Agreement (Q5445741) (← links)
- The Synchronous Condition-Based Consensus Hierarchy (Q5464188) (← links)
- Distributed Computing (Q5897411) (← links)
- Distributed Computing (Q5897412) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902003) (← links)
- Synchronizing the consistency relation (Q6175045) (← links)
