On the public citation graph

Compositional design of multitolerant repetitive byzantine agreement

https://doi.org/10.1007/bfb0058030
0 signed · 21 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/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf01211393openalex-snapshot
Transformation of programs for fault-tolerance
inferredcites →https://doi.org/10.1007/bf02277668openalex-snapshot
A self-adjusting algorithm for byzantine agreement
inferredcites →https://doi.org/10.1109/12.312126openalex-snapshot
Distributed reset
inferredcites →https://doi.org/10.1109/32.689401openalex-snapshot
Designing masking fault-tolerance via nonmasking fault-tolerance
inferredcites →https://doi.org/10.1109/apads.1993.588861openalex-snapshot
Adaptive fault tolerance
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.6100/ir417296openalex-snapshot
Fault tolerance and timing of distributed systems : compositional specification and verification

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11577327_4openalex-snapshot
Self-stabilization of Byzantine Protocols
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.022openalex-snapshot
Combining decomposition and reduction for state space analysis of a self-stabilizing system
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.012openalex-snapshot
Consensus when all processes may be Byzantine for some time
inferred← citeshttps://doi.org/10.1109/32.663998openalex-snapshot
Component based design of multitolerant systems
inferred← citeshttps://doi.org/10.1109/32.689401openalex-snapshot
Designing masking fault-tolerance via nonmasking fault-tolerance
inferred← citeshttps://doi.org/10.1109/aina.2012.127openalex-snapshot
Combining Decomposition and Reduction for State Space Analysis of a Self-Stabilizing System
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679772openalex-snapshot
Detectors and correctors: a theory of fault-tolerance components
inferred← citeshttps://doi.org/10.1109/reldis.2002.1180170openalex-snapshot
Tolerance to unbounded Byzantine faults
inferred← citeshttps://doi.org/10.1109/tdsc.2005.29openalex-snapshot
Complexity Issues in Automated Synthesis of Failsafe Fault-Tolerance
inferred← citeshttps://doi.org/10.1109/waina.2011.137openalex-snapshot
The Degree of Masking Fault Tolerance vs. Temporal Redundancy
inferred← citeshttps://doi.org/10.1145/311531.311532openalex-snapshot
Fundamentals of fault-tolerant distributed computing in asynchronous environments
inferred← citeshttps://doi.org/10.26083/tuprints-00000471openalex-snapshot
Automated Design of Efficient Fail-Safe Fault Tolerance
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.