On the public citation graph
Reaching (and maintaining) agreement in the presence of mobile faults
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-48658-5_38openalex-snapshot
Maintaining Security in the Presence of Transient Faults
inferredcites →https://doi.org/10.1007/bfb0035753openalex-snapshot
Asymptotically optimal distributed consensus
inferredcites →https://doi.org/10.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
inferredcites →https://doi.org/10.1016/0890-5401(90)90014-9openalex-snapshot
Knowledge and common knowledge in a Byzantine environment: Crash failures
inferredcites →https://doi.org/10.1016/s0019-9958(85)80042-5openalex-snapshot
A new solution for the Byzantine generals problem
inferredcites →https://doi.org/10.1109/sfcs.1993.366820openalex-snapshot
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
inferredcites →https://doi.org/10.1145/112600.112605openalex-snapshot
How to withstand mobile virus attacks (extended abstract)
inferredcites →https://doi.org/10.1145/112600.112627openalex-snapshot
Unreliable failure detectors for asynchronous systems (preliminary version)
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/41840.41844openalex-snapshot
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
inferredcites →https://doi.org/10.1145/62212.62225openalex-snapshot
Optimal algorithms for Byzantine agreement
inferredcites →https://doi.org/10.1145/800070.802215openalex-snapshot
Polynomial algorithms for multiple processor agreement
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_38openalex-snapshot
Maintaining Security in the Presence of Transient Faults
inferred← citeshttps://doi.org/10.1007/978-3-030-03232-6_28openalex-snapshot
Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded Timestamps
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_3openalex-snapshot
Blockchains and the Commons
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_8openalex-snapshot
Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.1007/978-3-031-38557-5_12openalex-snapshot
Perfect MPC over Layered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03850-6_17openalex-snapshot
Mobile Byzantine Agreement on Arbitrary Network
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_8openalex-snapshot
An Improved Approximate Consensus Algorithm in the Presence of Mobile Faults
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_10openalex-snapshot
On Composability of Reliable Unicast and Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_12openalex-snapshot
Authenticated Byzantine Generals in Dual Failure Model
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_38openalex-snapshot
Byzantine Agreement Using Partial Authentication
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_6openalex-snapshot
Tight Bound on Mobile Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/bfb0020424openalex-snapshot
Secure distributed computing: Theory and practice
inferred← citeshttps://doi.org/10.1007/s41109-024-00671-xopenalex-snapshot
Engineering consensus in static networks with unknown disruptors
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.ifacol.2020.12.1507openalex-snapshot
Resilient Consensus against Mobile Malicious Agents
inferred← citeshttps://doi.org/10.1016/j.nahs.2024.101473openalex-snapshot
Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.019openalex-snapshot
Tight bound on mobile Byzantine Agreement
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.020openalex-snapshot
Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.08.001openalex-snapshot
Approximate Agreement under Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.1088/2632-072x/ad9f0copenalex-snapshot
Resilient consensus for multiagent networks with time-varying delay and mobile adversaries
inferred← citeshttps://doi.org/10.1093/comjnl/bxad043openalex-snapshot
Resilient Vector Consensus Over Random Dynamic Networks Under Mobile Malicious Attacks
inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9992614openalex-snapshot
Self-Triggered Ternary Control for Resilient Consensus against Mobile Adversarial Agents
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00043openalex-snapshot
Modeling Mobile Crash in Byzantine Consensus
inferred← citeshttps://doi.org/10.1109/eurmic.1996.546469openalex-snapshot
Comparing performances and quality of service of group communication protocols
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466995openalex-snapshot
Optimal resiliency against mobile faults
inferred← citeshttps://doi.org/10.1109/icdcs.2016.68openalex-snapshot
Approximate Agreement under Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00104openalex-snapshot
Byzantine Agreement with Unknown Participants and Failures
inferred← citeshttps://doi.org/10.1109/nca.2018.8548345openalex-snapshot
Delivery Delay and Mobile Faults
inferred← citeshttps://doi.org/10.1109/srds.2017.20openalex-snapshot
Optimal Storage under Unsynchronized Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.1109/tac.2024.3507672openalex-snapshot
Dynamic Resilient Consensus of Second-Order Multiagent Networks With a Time-Varying Malicious Agent Set
inferred← citeshttps://doi.org/10.1109/tnse.2022.3176214openalex-snapshot
Resilient Consensus for Multi-Agent Systems Under Adversarial Spreading Processes
inferred← citeshttps://doi.org/10.1109/tpds.2021.3096074openalex-snapshot
Resilient Real-Valued Consensus in Spite of Mobile Malicious Agents on Directed Graphs
inferred← citeshttps://doi.org/10.1137/s009753970443999xopenalex-snapshot
Impossibility Results and Lower Bounds for Consensus under Link Failures
inferred← citeshttps://doi.org/10.1145/2767386.2767453openalex-snapshot
The "Mobile Adversary" Paradigm in Distributed Computation and Systems
inferred← citeshttps://doi.org/10.1145/2833312.2833320openalex-snapshot
Tight self-stabilizing mobile byzantine-tolerant atomic register
inferred← citeshttps://doi.org/10.1145/2933057.2933100openalex-snapshot
Optimal Mobile Byzantine Fault Tolerant Distributed Storage
inferred← citeshttps://doi.org/10.1145/3816782.3819213openalex-snapshot
Brief Announcement: Byzantine Generals with Stuttering Madness
inferred← citeshttps://doi.org/10.1145/872035.872065openalex-snapshot
Distributed consensus in the presence of sectional faults
inferred← citeshttps://doi.org/10.2139/ssrn.7593757openalex-snapshot
A Unified Framework for Mobile Byzantine Agreement with Trusted Monotonic Counters
inferred← citeshttps://doi.org/10.23919/acc63710.2025.11107941openalex-snapshot
Resilient Centerpoint-Based Vector Consensus Protocols Against Mobile Attacks
inferred← citeshttps://doi.org/10.23919/ecc54610.2021.9654845openalex-snapshot
Resilient Consensus Against Epidemic Malicious Attacks
inferred← citeshttps://doi.org/10.4230/lipics.aft.2025.13openalex-snapshot
A New Look at Composition of Authenticated Byzantine Generals
inferred← citeshttps://doi.org/10.48550/arxiv.1505.06865openalex-snapshot
Tight Mobile Byzantine Tolerant Atomic Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1706.06789openalex-snapshot
Agreement Protocols on an Arbitrary Network in the Presence of a Mobile Adversary
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05063openalex-snapshot
Optimal Storage under Unsynchrononized Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.70675/61d0c972z95dcz4855z9a17z927b1fcf4989openalex-snapshot
Tractable Reliable Communication in Compromised Networks
inferred← citeshttps://doi.org/10.70675/a9b17839z3659z470ez8e34zbb033848b575openalex-snapshot
Building distributed computing abstractions in the presence of mobile byzantine failures
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.