Synchronous \(t\)-resilient consensus in arbitrary graphs
From MaRDI portal
Publication:6044459
DOI10.1016/j.ic.2023.105035MaRDI QIDQ6044459
Ami Paz, Sergio Rajsbaum, Corentin Travers, Pierre Fraigniaud, Matthieu Roy, Armando Castañeda
Publication date: 19 May 2023
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Defining liveness
- Easy impossibility proofs for distributed consensus problems
- A lower bound for the time to assure interactive consistency
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- MinMax algorithms for stabilizing consensus
- A characterization of oblivious message adversaries for which consensus is solvable
- Agreement in synchronous networks with ubiquitous faults
- A Layered Analysis of Consensus
- Fault-Tolerant Consensus in Directed Graphs
- An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
- Authenticated Algorithms for Byzantine Agreement
- The Complexity of Data Aggregation in Directed Networks
- Impossibility of distributed consensus with one faulty process
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Distributed Computing: A Locality-Sensitive Approach
- Bounds on the Step and Namespace Complexity of Renaming
- Topological Characterization of Consensus under General Message Adversaries
- Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
- Fault-Tolerant Message-Passing Distributed Systems
- New combinatorial topology bounds for renaming
- A topological perspective on distributed network algorithms
