Pages that link to "Item:Q3495618"

The following pages link to Early stopping in Byzantine agreement (Q3495618):

Displaying 40 items.

• Agreement under faulty interfaces (Q293206) (← links)
• No double discount: condition-based simultaneity yields limited gain (Q418187) (← links)
• Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
• Message and time efficient consensus protocols for synchronous distributed systems (Q436769) (← links)
• A new solution for the Byzantine agreement problem (Q645812) (← links)
• The complexity of almost-optimal simultaneous coordination (Q675301) (← links)
• Simultaneity is harder than agreement (Q757014) (← links)
• The perfectly synchronized round-based model of distributed computing (Q879602) (← links)
• Multidimensional agreement in Byzantine systems (Q901876) (← links)
• Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
• A topological treatment of early-deciding set-agreement (Q1004319) (← links)
• Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
• On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
• A bivalency proof of the lower bound for uniform consensus (Q1044730) (← links)
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809) (← links)
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement (Q1187030) (← links)
• Efficient agreement using fault diagnosis. (Q1312601) (← links)
• A simple proof of the uniform consensus synchronous lower bound. (Q1853174) (← links)
• The overhead of consensus failure recovery (Q1954212) (← links)
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
• Unbeatable consensus (Q2121062) (← links)
• On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
• Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
• Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
• The firing squad problem revisited (Q2326403) (← links)
• Common knowledge and consistent simultaneous coordination (Q2365570) (← links)
• Synchronous condition-based consensus (Q2375299) (← links)
• The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
• The \(k\)-simultaneous consensus problem (Q2377137) (← links)
• Efficient algorithms for anonymous Byzantine agreement (Q2480748) (← links)
• Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
• The Firing Squad Problem Revisited. (Q3304114) (← links)
• How to Solve Consensus in the Smallest Window of Synchrony (Q3540219) (← links)
• No Double Discount: Condition-Based Simultaneity Yields Limited Gain (Q3540247) (← links)
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds (Q4031319) (← links)
• Message-optimal protocols for Byzantine Agreement (Q4031321) (← links)
• Fast and simple distributed consensus (Q5136978) (← links)
• Optimal time byzantine agreement for t <n/8 with linear-messages (Q5137009) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• Narrowing Power vs. Efficiency in Synchronous Set Agreement (Q5445741) (← links)