Pages that link to "Item:Q1168726"
From MaRDI portal
The following pages link to A lower bound for the time to assure interactive consistency (Q1168726):
Displaying 50 items.
- The topology of distributed adversaries (Q360277) (← links)
- Visiting Byzantine Agreement underlying ad hoc environment (Q367989) (← links)
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- Verifiable secret sharing in a total of three rounds (Q456152) (← links)
- Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems (Q528185) (← links)
- A new solution for the Byzantine agreement problem (Q645812) (← links)
- Consensus algorithms with one-bit messages (Q757011) (← links)
- Simultaneity is harder than agreement (Q757014) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- The perfectly synchronized round-based model of distributed computing (Q879602) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (Q916352) (← links)
- Knowledge and common knowledge in a Byzantine environment: Crash failures (Q918186) (← links)
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← 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)
- How processes learn (Q1082071) (← links)
- Programming simultaneous actions using common knowledge (Q1104074) (← links)
- Reliable broadcasts and communication models: tradeoffs and lower bounds (Q1112599) (← 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)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- Efficient parallel algorithms can be made robust (Q1189859) (← links)
- A self-adjusting algorithm for Byzantine agreement (Q1189860) (← links)
- Using knowledge to optimally achieve coordination in distributed systems (Q1292424) (← links)
- Wait-free implementations in message-passing systems (Q1292433) (← links)
- Efficient agreement using fault diagnosis. (Q1312601) (← links)
- An algorithmic approach to the asynchronous computability theorem (Q1616400) (← links)
- The overhead of consensus failure recovery (Q1954212) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Byzantine preferential voting (Q2190409) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
- Lower bounds for weak Byzantine agreement (Q2277850) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← 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)
- Lower bound for scalable Byzantine agreement (Q2377258) (← links)
- Agreement in synchronous networks with ubiquitous faults (Q2382676) (← links)
- Performance study of Byzantine agreement protocol with artificial neural network (Q2384832) (← links)
- Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
- Efficient algorithms for anonymous Byzantine agreement (Q2480748) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources (Q2956041) (← links)
