Synchronous t-resilient consensus in arbitrary graphs

DOI10.1016/J.IC.2023.105035MaRDI QIDQ6044459zbMATH OpenFDO

Authors Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers

Publication date 19 May 2023

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2023.105035

zbMATH Keywords

combinatorial topologyconsensuscrash failuresdistributed graph algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A characterization of oblivious message adversaries for which consensus is solvable
• A layered analysis of consensus
• A lower bound for the time to assure interactive consistency
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
• A topological perspective on distributed network algorithms
• Agreement in synchronous networks with ubiquitous faults
• An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
• Authenticated Algorithms for Byzantine Agreement
• Bounds on the step and namespace complexity of renaming
• Defining liveness
• Distributed computing through combinatorial topology
• Distributed Computing: A Locality-Sensitive Approach
• Easy impossibility proofs for distributed consensus problems
• Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
• Fault-tolerant consensus in directed graphs
• Fault-tolerant message-passing distributed systems. An algorithmic approach
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• MinMax algorithms for stabilizing consensus
• New combinatorial topology bounds for renaming: the upper bound
• The Byzantine Generals Problem
• The Byzantine generals strike again
• The complexity of data aggregation in directed networks
• Topological Characterization of Consensus under General Message Adversaries

Cited in

(3)

• General resilient consensus algorithms
• Simplicial models for the epistemic logic of faulty agents
• Agreement tasks in fault-prone synchronous networks of arbitrary structure

This page was built for publication: Synchronous \(t\)-resilient consensus in arbitrary graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6044459)