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 31 items.
- Reliable synchronization in distributed systems (Q3154799) (← links)
- Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources (Q3448780) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds (Q4031319) (← links)
- Message-optimal protocols for Byzantine Agreement (Q4031321) (← links)
- Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323) (← links)
- An algorithm for identification of maliciously faulty units (Q4323717) (← links)
- (Q5091092) (← 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)
- (Q5155689) (← links)
- Efficient Counting with Optimal Resilience (Q5359491) (← links)
- Narrowing Power vs. Efficiency in Synchronous Set Agreement (Q5445741) (← links)
- Fault-tolerant algorithms for tick-generation in asynchronous logic (Q5501934) (← links)
- Near-optimal self-stabilising counting and firing squads (Q5919570) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
- On the number of authenticated rounds in Byzantine Agreement (Q6084559) (← links)
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement (Q6093586) (← links)
- Asymptotically free broadcast in constant expected time via packed VSS (Q6114239) (← links)
- Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures (Q6161036) (← links)
- Fast agreement in networks with Byzantine nodes (Q6535029) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6536327) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
- Memory checking for parallel RAMs (Q6582183) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Simplicial models for the epistemic logic of faulty agents (Q6624996) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
- Perfect (parallel) broadcast in constant expected rounds via statistical VSS (Q6637549) (← links)
- Sublinear message bounds of authenticated implicit Byzantine agreement (Q6646446) (← links)
