Pages that link to "Item:Q1606983"

The following pages link to A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds (Q1606983):

Displaying 17 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)
• Bounded cost algorithms for multivalued consensus using binary consensus instances (Q989554) (← links)
• Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links (Q990091) (← 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)
• Functions on the real line with nonnegative Fourier transforms (Q1338400) (← links)
• A simple proof of the uniform consensus synchronous lower bound. (Q1853174) (← links)
• The inherent price of indulgence (Q1953640) (← links)
• Synchronous condition-based consensus (Q2375299) (← links)
• Agreement in synchronous networks with ubiquitous faults (Q2382676) (← links)
• Performance study of Byzantine agreement protocol with artificial neural network (Q2384832) (← links)
• Back to the Coordinated Attack Problem (Q5006457) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• Narrowing Power vs. Efficiency in Synchronous Set Agreement (Q5445741) (← links)
• Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
• Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures (Q6161036) (← links)