On the public citation graph

Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs

0 signed · 82 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/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1017/s0305004100033399openalex-snapshot
Weak ergodicity in non-homogeneous Markov chains
inferredcites →https://doi.org/10.1090/s0002-9939-1963-0154756-3openalex-snapshot
Products of Indecomposable, Aperiodic, Stochastic Matrices
inferredcites →https://doi.org/10.1109/acc.2012.6315661openalex-snapshot
Robustness of information diffusion algorithms to locally bounded adversaries
inferredcites →https://doi.org/10.1109/iecon.2001.975602openalex-snapshot
Global convergence in partially fully connected networks (PFCN) with limited relays
inferredcites →https://doi.org/10.1109/isit.2010.5513273openalex-snapshot
Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices
inferredcites →https://doi.org/10.1109/tac.2003.812781openalex-snapshot
Coordination of groups of mobile autonomous agents using nearest neighbor rules
inferredcites →https://doi.org/10.1142/s021962200300063xopenalex-snapshot
GLOBAL CONVERGENCE IN PARTIALLY FULLY CONNECTED NETWORKS (PFCN) WITH LIMITED RELAYS
inferredcites →https://doi.org/10.1145/10590.10597openalex-snapshot
Asymptotically optimal algorithms for approximate agreement
inferredcites →https://doi.org/10.1145/1967701.1967742openalex-snapshot
Consensus in networked multi-agent systems with adversaries
inferredcites →https://doi.org/10.1145/2185505.2185507openalex-snapshot
Consensus of multi-agent networks in the presence of adversaries using only local information
inferredcites →https://doi.org/10.1145/2185632.2185637openalex-snapshot
Low complexity resilient consensus in networked multi-agent systems with adversaries
inferredcites →https://doi.org/10.1145/2332432.2332505openalex-snapshot
Iterative approximate byzantine consensus in arbitrary directed graphs
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/588059.588060openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/5925.5931openalex-snapshot
Reaching approximate agreement in the presence of faults
inferredcites →https://doi.org/10.48550/arxiv.1109.6392openalex-snapshot
Distributed Algorithms for Consensus and Coordination in the Presence of Packet-Dropping Communication Links - Part II: Coefficients of Ergodicity Analysis Approach
inferredcites →https://doi.org/10.48550/arxiv.1202.6094openalex-snapshot
Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs - Part II: Synchronous and Asynchronous Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-64348-5_15openalex-snapshot
Brief Announcement: Byzantine Geoconsensus
inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_2openalex-snapshot
Byzantine Geoconsensus
inferred← citeshttps://doi.org/10.1007/978-3-319-09581-3_7openalex-snapshot
Iterative Approximate Consensus in the Presence of Byzantine Link Failures
inferred← citeshttps://doi.org/10.1007/978-3-319-21741-3_2openalex-snapshot
Reaching Approximate Byzantine Consensus with Multi-hop Communication
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_29openalex-snapshot
Robust Multi-agent Optimization: Coping with Byzantine Agents with Input Redundancy
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_30openalex-snapshot
Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_6openalex-snapshot
Iterative Approximate Byzantine Consensus under a Generalized Fault Model
inferred← citeshttps://doi.org/10.1007/978-3-642-45249-9_2openalex-snapshot
Iterative Byzantine Vector Consensus in Incomplete Graphs
inferred← citeshttps://doi.org/10.1007/s00446-018-0336-4openalex-snapshot
Defending non-Bayesian learning against adversarial attacks
inferred← citeshttps://doi.org/10.1007/s00446-024-00468-2openalex-snapshot
Iterative approximate Byzantine consensus in arbitrary directed graphs
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2022.01.004openalex-snapshot
An overview on multi-agent consensus under adversarial attacks
inferred← citeshttps://doi.org/10.1016/j.automatica.2017.03.008openalex-snapshot
Resilient consensus of second-order agent networks: Asynchronous update rules with delays
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.04.029openalex-snapshot
Resilient consensus for multi-agent systems subject to differential privacy requirements
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109775openalex-snapshot
Secure consensus with distributed detection via two-hop communication
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111908openalex-snapshot
Asynchronous approximate Byzantine consensus: A multi-hop relay method and tight graph conditions
inferred← citeshttps://doi.org/10.1016/j.ic.2016.12.003openalex-snapshot
Reaching approximate Byzantine consensus with multi-hop communication
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.05.005openalex-snapshot
Approximate Byzantine consensus in sparse, mobile ad-hoc networks
inferred← citeshttps://doi.org/10.1016/j.nahs.2021.101091openalex-snapshot
Resilient self/event-triggered consensus based on ternary control
inferred← citeshttps://doi.org/10.1016/j.nahs.2025.101579openalex-snapshot
Privacy-preserving resilient bipartite consensus of multi-agent systems: A differential privacy scheme
inferred← citeshttps://doi.org/10.1016/j.neucom.2023.126315openalex-snapshot
Resilient distributed hypothesis testing under time-varying multi-agent networks with multiple types of adversarial agents
inferred← citeshttps://doi.org/10.1080/18824889.2021.1988396openalex-snapshot
Resiliency against malicious agents in maximum-based consensus
inferred← citeshttps://doi.org/10.1109/acc.2015.7170960openalex-snapshot
Approximate byzantine consensus in faulty asynchronous networks
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483432openalex-snapshot
Resilient asymptotic consensus in asynchronous robust networks
inferred← citeshttps://doi.org/10.1109/allerton.2015.7447011openalex-snapshot
Consensus-based distributed optimization with malicious nodes
inferred← citeshttps://doi.org/10.1109/cdc.2015.7403019openalex-snapshot
Convergence rate analysis of a fault-tolerant distributed consensus algorithm
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683145openalex-snapshot
Towards Resilience for Multi-Agent QD-Learning
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413992openalex-snapshot
Byzantine-Resilient Decentralized TD Learning with Linear Function Approximation
inferred← citeshttps://doi.org/10.1109/icca.2017.8003106openalex-snapshot
Resilient distributed optimization algorithm against adversary attacks
inferred← citeshttps://doi.org/10.1109/ieeeconf60004.2024.10942734openalex-snapshot
Byzantine-Resilient Collaborative Hierarchical Non-Bayesian Learning
inferred← citeshttps://doi.org/10.1109/iscc53001.2021.9631546openalex-snapshot
An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication
inferred← citeshttps://doi.org/10.1109/jsac.2013.130413openalex-snapshot
Resilient Asymptotic Consensus in Robust Networks
inferred← citeshttps://doi.org/10.1109/lcsys.2024.3457851openalex-snapshot
Byzantine Attack Resilient Bounded Consensus
inferred← citeshttps://doi.org/10.1109/msp.2020.2973345openalex-snapshot
Adversary-Resilient Distributed and Decentralized Statistical Inference and Machine Learning: An Overview of Recent Advances Under the Byzantine Threat Model
inferred← citeshttps://doi.org/10.1109/tac.2018.2836919openalex-snapshot
Distributed Optimization Under Adversarial Nodes
inferred← citeshttps://doi.org/10.1109/tac.2019.2951686openalex-snapshot
Finite-Time Guarantees for Byzantine-Resilient Distributed State Estimation With Noisy Measurements
inferred← citeshttps://doi.org/10.1109/tac.2019.2954363openalex-snapshot
Resilient Distributed Optimization Algorithm Against Adversarial Attacks
inferred← citeshttps://doi.org/10.1109/tac.2020.3008139openalex-snapshot
Byzantine-Resilient Multiagent Optimization
inferred← citeshttps://doi.org/10.1109/tac.2020.3033126openalex-snapshot
A New Approach to Distributed Hypothesis Testing and Non-Bayesian Learning: Improved Learning Rate and Byzantine Resilience
inferred← citeshttps://doi.org/10.1109/tnnls.2023.3292036openalex-snapshot
Communication-Efficient and Resilient Distributed Q -Learning
inferred← citeshttps://doi.org/10.1109/tnse.2023.3342165openalex-snapshot
Accelerated Distributed Optimization Algorithm With Malicious Nodes
inferred← citeshttps://doi.org/10.1109/tsipn.2019.2928176openalex-snapshot
ByRDiE: Byzantine-Resilient Distributed Coordinate Descent for Decentralized Learning
inferred← citeshttps://doi.org/10.1109/tsipn.2022.3188456openalex-snapshot
BRIDGE: Byzantine-Resilient Decentralized Gradient Descent
inferred← citeshttps://doi.org/10.1109/tsp.2021.3090952openalex-snapshot
Byzantine-Resilient Decentralized Policy Evaluation With Linear Function Approximation
inferred← citeshttps://doi.org/10.1109/tsp.2022.3209010openalex-snapshot
Byzantine-Resilient Resource Allocation Over Decentralized Networks
inferred← citeshttps://doi.org/10.1145/2332432.2332505openalex-snapshot
Iterative approximate byzantine consensus in arbitrary directed graphs
inferred← citeshttps://doi.org/10.1145/2611462.2611470openalex-snapshot
Asynchronous convex hull consensus in the presence of crash faults
inferred← citeshttps://doi.org/10.1145/2993749.2993763openalex-snapshot
Distributed Computing Column 63
inferred← citeshttps://doi.org/10.1145/2993749.2993764openalex-snapshot
A Note on Fault-tolerant Consensus in Directed Networks
inferred← citeshttps://doi.org/10.1145/3427477.3429771openalex-snapshot
Byzantine fault-tolerant consensus over random graph processes
inferred← citeshttps://doi.org/10.1145/3616537openalex-snapshot
Byzantine Machine Learning: A Primer
inferred← citeshttps://doi.org/10.23919/acc.2019.8815195openalex-snapshot
A New Approach for Distributed Hypothesis Testing with Extensions to Byzantine-Resilience
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867506openalex-snapshot
Distributed Online Optimization with Byzantine Adversarial Agents
inferred← citeshttps://doi.org/10.23919/ccc63176.2024.10662289openalex-snapshot
Resilient Distributed Optimization Algorithm Based on Trusted Nodes against Malicious Attacks
inferred← citeshttps://doi.org/10.23919/fusion43075.2019.9011353openalex-snapshot
Distributed Learning over Time-Varying Graphs with Adversarial Agents
inferred← citeshttps://doi.org/10.3182/20140824-6-za-1003.02753openalex-snapshot
Secure Consensus against Message Manipulation Attacks in Synchronous Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1411.5282openalex-snapshot
Reaching Approximate Byzantine Consensus with Multi-hop Communication
inferred← citeshttps://doi.org/10.48550/arxiv.1507.01845openalex-snapshot
Byzantine Multi-Agent Optimization: Part II
inferred← citeshttps://doi.org/10.48550/arxiv.1509.01864openalex-snapshot
Fault-Tolerant Multi-Agent Optimization: Part III
inferred← citeshttps://doi.org/10.48550/arxiv.1511.01821openalex-snapshot
Fault-Tolerant Distributed Optimization (Part IV): Constrained Optimization with Arbitrary Directed Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2010.05098openalex-snapshot
Relay Protocol for Approximate Byzantine Consensus
inferred← citeshttps://doi.org/10.48550/arxiv.2101.12316openalex-snapshot
Byzantine Fault-Tolerance in Peer-to-Peer Distributed Gradient-Descent
inferred← citeshttps://doi.org/10.48550/arxiv.2104.03153openalex-snapshot
Towards Resilience for Multi-Agent $QD$-Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2106.08545openalex-snapshot
A Survey on Fault-tolerance in Distributed Optimization and Machine Learning
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.