Synchronous \(t\)-resilient consensus in arbitrary graphs
From MaRDI portal
Publication:6536327
DOI10.1007/978-3-030-34992-9_5zbMATH Open1543.68031MaRDI QIDQ6536327
Armando Castañeda, Matthieu Roy, Ami Paz, Sergio Rajsbaum, Pierre Fraigniaud, Corentin Travers
Publication date: 19 April 2024
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- 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
- Fast consensus in networks of bounded degree.
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- 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
- 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
- A topological perspective on distributed network algorithms
This page was built for publication: Synchronous \(t\)-resilient consensus in arbitrary graphs
