Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions

Cites Work

Title not available (Why is that?)
Global leader-following consensus of a group of general linear systems using bounded controls
Resilient stabilization of multi-hop control networks subject to malicious attacks
Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies
Approximate agreement under mobile Byzantine faults
Reaching approximate Byzantine consensus with multi-hop communication
Chance-constrained \(H_\infty\) control for a class of time-varying systems with stochastic nonlinearities: the finite-horizon case
Resilient consensus of second-order agent networks: asynchronous update rules with delays
Secure consensus with distributed detection via two-hop communication
Fault-tolerant consensus in directed graphs
Iterative approximate byzantine consensus in arbitrary directed graphs
Reaching approximate agreement in the presence of faults
The Byzantine generals strike again
Consensus and Cooperation in Networked Multi-Agent Systems
Improving Network Connectivity and Robustness Using Trusted Nodes With Application to Resilient Consensus
Resilient Randomized Quantized Consensus
A Probabilistic Characterization of Random and Malicious Communication Failures in Multi-Hop Networked Control
Resilient Consensus Through Event-Based Communication
Fundamentals of Wireless Communication
State consensus for multi-agent systems with switching topologies and time-varying delays
Principles of Distributed Systems
Asynchronous Byzantine Approximate Consensus in Directed Networks
Distributed secure state estimation for linear systems against malicious agents through sorting and filtering

This page was built for publication: Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions

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