Pages that link to "Item:Q4388871"
From MaRDI portal
The following pages link to Fully Polynomial Byzantine Agreement for <i>n</i> > 3<i>t</i> Processors in <i>t</i> + 1 Rounds (Q4388871):
Displaying 25 items.
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- The perfectly synchronized round-based model of distributed computing (Q879602) (← links)
- Game authority for robust and scalable distributed selfish-computer systems (Q974739) (← links)
- Continuous consensus with ambiguous failures (Q986534) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- Efficient agreement using fault diagnosis. (Q1312601) (← links)
- A flexible formal framework for masking/demasking faults (Q1827146) (← links)
- Quantum Byzantine agreement with tripartite entangled states (Q2323766) (← links)
- Agreement in synchronous networks with ubiquitous faults (Q2382676) (← links)
- Reliable broadcast with respect to topology knowledge (Q2407628) (← links)
- Efficient algorithms for anonymous Byzantine agreement (Q2480748) (← links)
- The Byzantine Generals Problem in Generic and Wireless Networks (Q2926152) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Byzantine Agreement in Expected Polynomial Time (Q3177770) (← links)
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time (Q4304063) (← links)
- Optimal time byzantine agreement for t <n/8 with linear-messages (Q5137009) (← links)
- Continuous Consensus with Ambiguous Failures (Q5445739) (← links)
- Byzantine agreement with homonyms (Q5920298) (← links)
- Fast agreement in networks with Byzantine nodes (Q6535029) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Early stopping for any number of corruptions (Q6637339) (← links)
- Sublinear message bounds of authenticated implicit Byzantine agreement (Q6646446) (← links)
