On the public citation graph

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

0 signed · 42 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11516798_17openalex-snapshot
Optimal Resilience Asynchronous Approximate Agreement
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1016/j.automatica.2009.05.002openalex-snapshot
Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies
inferredcites →https://doi.org/10.1016/j.automatica.2016.01.027openalex-snapshot
Global leader-following consensus of a group of general linear systems using bounded controls
inferredcites →https://doi.org/10.1016/j.automatica.2016.04.016openalex-snapshot
Resilient stabilization of Multi-Hop Control Networks subject to malicious attacks
inferredcites →https://doi.org/10.1016/j.automatica.2017.03.008openalex-snapshot
Resilient consensus of second-order agent networks: Asynchronous update rules with delays
inferredcites →https://doi.org/10.1016/j.automatica.2019.05.039openalex-snapshot
Chance-constrained H ∞ control for a class of time-varying systems with stochastic nonlinearities: The finite-horizon case
inferredcites →https://doi.org/10.1016/j.automatica.2019.06.039openalex-snapshot
Byzantine-resilient distributed observers for LTI systems
inferredcites →https://doi.org/10.1016/j.automatica.2021.109775openalex-snapshot
Secure consensus with distributed detection via two-hop communication
inferredcites →https://doi.org/10.1016/j.automatica.2023.110927openalex-snapshot
Distributed secure state estimation for linear systems against malicious agents through sorting and filtering
inferredcites →https://doi.org/10.1016/j.ic.2016.12.003openalex-snapshot
Reaching approximate Byzantine consensus with multi-hop communication
inferredcites →https://doi.org/10.1016/j.tcs.2018.08.001openalex-snapshot
Approximate Agreement under Mobile Byzantine Faults
inferredcites →https://doi.org/10.1017/cbo9780511841224openalex-snapshot
Wireless Communications
inferredcites →https://doi.org/10.1080/00207170600825097openalex-snapshot
State consensus for multi-agent systems with switching topologies and time-varying delays
inferredcites →https://doi.org/10.1109/acc.2016.7526165openalex-snapshot
Resilient Randomized Quantized Consensus
inferredcites →https://doi.org/10.1109/cdc.2006.377298openalex-snapshot
Multi-Hop Relay Protocols for Fast Consensus Seeking
inferredcites →https://doi.org/10.1109/cdc51059.2022.9993067openalex-snapshot
Event-triggered Approximate Byzantine Consensus with Multi-hop Communication
inferredcites →https://doi.org/10.1109/iscc53001.2021.9631546openalex-snapshot
An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication
inferredcites →https://doi.org/10.1109/jproc.2006.887293openalex-snapshot
Consensus and Cooperation in Networked Multi-Agent Systems
inferredcites →https://doi.org/10.1109/jsac.2013.130413openalex-snapshot
Resilient Asymptotic Consensus in Robust Networks
inferredcites →https://doi.org/10.1109/tcns.2017.2782486openalex-snapshot
Improving Network Connectivity and Robustness Using Trusted Nodes With Application to Resilient Consensus
inferredcites →https://doi.org/10.1109/tcns.2019.2924235openalex-snapshot
Resilient Consensus Through Event-Based Communication
inferredcites →https://doi.org/10.1137/17m1158021openalex-snapshot
A Probabilistic Characterization of Random and Malicious Communication Failures in Multi-Hop Networked Control
inferredcites →https://doi.org/10.1145/2332432.2332505openalex-snapshot
Iterative approximate byzantine consensus in arbitrary directed graphs
inferredcites →https://doi.org/10.1145/2767386.2767399openalex-snapshot
Fault-Tolerant Consensus in Directed Graphs
inferredcites →https://doi.org/10.1145/3382734.3405724openalex-snapshot
Asynchronous Byzantine Approximate Consensus in Directed Networks
inferredcites →https://doi.org/10.1145/5925.5931openalex-snapshot
Reaching approximate agreement in the presence of faults
inferredcites →https://doi.org/10.21236/ada558910openalex-snapshot
Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rob.70010openalex-snapshot
Parallel Byzantine Fault Tolerance Consensus for Blockchain Secured Swarm Robots
inferred← citeshttps://doi.org/10.1007/s11128-026-05150-zopenalex-snapshot
Resilient hybrid quantum–classical consensus protocol for Byzantine faults over r-robust multiplex networks in the NISQ era
inferred← citeshttps://doi.org/10.1016/b978-0-443-14081-5.00131-8openalex-snapshot
Resilience in Distributed Consensus Algorithms
inferred← citeshttps://doi.org/10.1016/j.engappai.2026.115802openalex-snapshot
Practical bipartite flocking in quasi-structurally balanced signed networks under Byzantine attacks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2025.07.054openalex-snapshot
Distributed Parameter Estimation with Adversaries via Multi-Hop Relays
inferred← citeshttps://doi.org/10.1109/jiot.2026.3672264openalex-snapshot
Secure Consensus Control of Multiagent Systems With Byzantine Attacks and Multihop Robust Communication Graph
inferred← citeshttps://doi.org/10.1109/tac.2025.3621981openalex-snapshot
Resilient Distributed Economic Dispatch in Smart Grids
inferred← citeshttps://doi.org/10.1109/tac.2025.3629508openalex-snapshot
Resilient Quantized Consensus in Multihop Relay Networks
inferred← citeshttps://doi.org/10.1109/tac.2026.3680751openalex-snapshot
Reaching Resilient Leader–Follower Consensus in Time-Varying Networks via Multihop Relays
inferred← citeshttps://doi.org/10.1109/tac.2026.3683008openalex-snapshot
Distributed Secure State Estimation Against Byzantine Agents: A Multihop Relay-Based Sorting and Filtering Method
inferred← citeshttps://doi.org/10.1109/tcns.2025.3649113openalex-snapshot
Resilient Consensus of State-Delayed Uncertain Lagrangian Agents Using Sampled and Delayed Neighbor Information
inferred← citeshttps://doi.org/10.1109/tsipn.2025.3594015openalex-snapshot
Geometric Methods for Resilient Aggregation and Safe Point Computation in Adversarial Multiagent Networks With Imprecise Data
inferred← citeshttps://doi.org/10.23919/acc63710.2025.11108017openalex-snapshot
Resilient Leader-Follower Consensus with Multi-Hop Communication
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.