Distributed agreement in the presence of processor and communication faults
From MaRDI portal
Recommendations
Cited in
(47)- How to cope with faulty processors in a completely connected network of communicating processors
- Programming simultaneous actions using common knowledge
- Two distributed problems involving Byzantine processes
- Consensus under unreliable transmission
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Mutual information agreement in multicomputer systems with the detection and identification of Byzantine faults
- Communication-efficient failure detection and consensus in omission environments
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Consensus in anonymous asynchronous systems with crash-recovery and omission failures
- Common knowledge and consistent simultaneous coordination
- The Heard-Of model: computing in distributed systems with benign faults
- Agreement in synchronous networks with ubiquitous faults
- Reaching agreement on processor-group membership in synchronous distributed systems
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation
- Agreement under faulty interfaces
- Authenticated Algorithms for Byzantine Agreement
- scientific article; zbMATH DE number 4195141 (Why is no real title available?)
- scientific article; zbMATH DE number 3846851 (Why is no real title available?)
- scientific article; zbMATH DE number 5506092 (Why is no real title available?)
- A new solution for the Byzantine generals problem
- Fast Distributed Agreement
- scientific article; zbMATH DE number 1203412 (Why is no real title available?)
- Performing Work Efficiently in the Presence of Faults
- Consensus in the presence of mortal Byzantine faulty processes
- scientific article; zbMATH DE number 568828 (Why is no real title available?)
- Implementing fail-silent nodes for distributed systems
- scientific article; zbMATH DE number 2080904 (Why is no real title available?)
- On the impact of link faults on Byzantine agreement
- Time is not a healer (preliminary version)
- State machine replication with benign failures
- Performing work efficiently in the presence of faults
- Signature-free communication and agreement in the presence of Byzantine processes
- scientific article; zbMATH DE number 6297761 (Why is no real title available?)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Structural Information and Communication Complexity
- Distributed computing in asynchronous networks with byzantine edges
- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
- Randomization can be a healer: consensus with dynamic omission failures
- Consensus in the presence of overlapping faults and total omission
- General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
- Topological characterization of consensus in distributed systems
- Synchronous consensus under hybrid process and link failures
- Managed agreement: generalizing two fundamental distributed agreement problems
- A distributed synchronization scheme for fair multi-process handshakes
- An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network
- The incremental agreement
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
This page was built for publication: Distributed agreement in the presence of processor and communication faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713588)
