On the public citation graph
Fault-Tolerant Distributed Computing
0 signed · 65 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-15216-4_17openalex-snapshot
The argus language and system
inferredcites →https://doi.org/10.1109/ftcs.1988.5297openalex-snapshot
Fault tolerant concurrent C: a tool for writing fault tolerant distributed programs
inferredcites →https://doi.org/10.1145/102792.102801openalex-snapshot
Understanding fault-tolerant distributed systems
inferredcites →https://doi.org/10.1145/29868.31332openalex-snapshot
On the reliability of consensus-based fault-tolerant distributed computing systems
inferredcites →https://doi.org/10.1145/800220.806675openalex-snapshot
Language constructs and support systems for distributed computing
inferredcites →https://doi.org/10.1145/98163.98167openalex-snapshot
Implementing fault-tolerant services using the state machine approach: a tutorial
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11767886_3openalex-snapshot
Gossip-Based Clock Synchronization for Large Decentralized Systems
inferred← citeshttps://doi.org/10.1007/3-540-36087-5_109openalex-snapshot
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-37795-6_6openalex-snapshot
Comparing the Atomic Commitment and Consensus Problems
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_19openalex-snapshot
About the Relationship between Election Problem and Failure Detector in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-45785-2_22openalex-snapshot
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-47910-4_18openalex-snapshot
A Language Framework for Multi-Object Coordination
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_9openalex-snapshot
Fair Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-0-585-27316-7_3openalex-snapshot
Language Support for Fault-Tolerant Parallel and Distributed Programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_15openalex-snapshot
Algebraic Specification of Dynamic Leader Election Protocols in Broadcast Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-2416-0_19openalex-snapshot
Clock Synchronization and Synchronous Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-1599-9_8openalex-snapshot
On the Dependability Design of Manufacturing Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11764-5_23openalex-snapshot
Tight Bounds for Stabilizing Uniform Consensus in Mobile Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-39425-9_23openalex-snapshot
A Probabilistically Correct Election Protocol in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_9openalex-snapshot
Booting Clock Synchronization in Partially Synchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-77048-0_27openalex-snapshot
Modeling Agreement Problems in the Universal Composability Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_7openalex-snapshot
Clock Synchronization in the Byzantine-Recovery Failure Model
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_24openalex-snapshot
Optimal Deterministic Remote Clock Estimation in Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_24openalex-snapshot
Synthesis of Fault-Tolerant Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-16629-7_12openalex-snapshot
Fuzzy Methods on the Web: A Critical Discussion
inferred← citeshttps://doi.org/10.1007/978-3-642-32692-9_13openalex-snapshot
Solving Non-Blocking Atomic Commitment Problem in Asynchronous Distributed Systems with Unreliable Failure Detectors
inferred← citeshttps://doi.org/10.1007/978-3-642-33078-0_29openalex-snapshot
Non-Blocking Atomic Commitment in Asynchronous Distributed Systems with Faulty Processes
inferred← citeshttps://doi.org/10.1007/bfb0022139openalex-snapshot
The inherent cost of strong-partial view-synchronous communication
inferred← citeshttps://doi.org/10.1007/bfb0026751openalex-snapshot
Distributed storage of replicated beliefs to facilitate recovery of distributed intelligent agents
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00022-gopenalex-snapshot
Hyper-ring connection machines
inferred← citeshttps://doi.org/10.1016/0169-7552(94)00105-3openalex-snapshot
SSCMP: the sequenced synchronized clock message protocol
inferred← citeshttps://doi.org/10.1016/0278-6125(88)90042-8openalex-snapshot
Fault-tolerant heterarchical control of heterogeneous manufacturing system entities
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.030openalex-snapshot
Capability-Passing Processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.018openalex-snapshot
On the Impact of Formal Methods in the SOA
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.11.001openalex-snapshot
Uniform consensus is harder than consensus
inferred← citeshttps://doi.org/10.1016/j.scico.2007.01.007openalex-snapshot
Capability passing processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.09.014openalex-snapshot
Abstractions for fault-tolerant global computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.012openalex-snapshot
Towards a real-time distributed computing model
inferred← citeshttps://doi.org/10.1016/s0169-023x(03)00019-3openalex-snapshot
A conceptual model for increasing utilization of dependable computer networks
inferred← citeshttps://doi.org/10.1016/s0360-8352(97)00048-xopenalex-snapshot
Simulation on a fault tolerant multiprocessor system
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80419-5openalex-snapshot
Abstractions for Fault-Tolerant Global Computing
inferred← citeshttps://doi.org/10.1023/a:1008026017515openalex-snapshot
On the Dependability Design of Manufacturing Information Systems
inferred← citeshttps://doi.org/10.1109/12.364532openalex-snapshot
Programming language support for writing fault-tolerant distributed software
inferred← citeshttps://doi.org/10.1109/49.223866openalex-snapshot
Increasing availability and security of an authentication service
inferred← citeshttps://doi.org/10.1109/csfw.1993.246633openalex-snapshot
Variations on the themes of message freshness and replay-or the difficulty in devising formal methods to analyze cryptographic protocols
inferred← citeshttps://doi.org/10.1109/ftcs.1994.315620openalex-snapshot
Highly available cluster: a case study
inferred← citeshttps://doi.org/10.1109/ftdcs.1995.525002openalex-snapshot
A generic multicast primitive to support transactions on replicated objects in distributed systems
inferred← citeshttps://doi.org/10.1109/hicss.1997.663156openalex-snapshot
Distributed route initialization algorithms for the Monash Secure RISC Multiprocessor
inferred← citeshttps://doi.org/10.1109/ichit.2008.222openalex-snapshot
An Effective XML Data Release in Dynamic Environments
inferred← citeshttps://doi.org/10.1109/icpads.1998.741040openalex-snapshot
One-phase commit: does it make sense?
inferred← citeshttps://doi.org/10.1109/reldis.1994.336900openalex-snapshot
A protocol description language for customizing failure semantics
inferred← citeshttps://doi.org/10.1109/spdp.1995.530658openalex-snapshot
The Decentralized Non-Blocking Atomic Commitment Protocol
inferred← citeshttps://doi.org/10.1145/1011767.1011818openalex-snapshot
The weakest failure detectors to solve certain fundamental problems in distributed computing
inferred← citeshttps://doi.org/10.1145/152610.152612openalex-snapshot
The consensus problem in fault-tolerant computing
inferred← citeshttps://doi.org/10.1145/1891748.1891750openalex-snapshot
Adaptive service migration and transaction processing in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/2600212.2600218openalex-snapshot
When paxos meets erasure code
inferred← citeshttps://doi.org/10.1145/2933057.2933120openalex-snapshot
Unbeatable Set Consensus via Topological and Combinatorial Reasoning
inferred← citeshttps://doi.org/10.1145/3659211.3659272openalex-snapshot
Research on Improved OLLVM Based on Code Rearrangement Architecture
inferred← citeshttps://doi.org/10.19080/ttsr.2018.03.555606openalex-snapshot
Framework for Detecting Fault in Real Time Distributed System
inferred← citeshttps://doi.org/10.3390/info16080712openalex-snapshot
Management of Virtualized Railway Applications
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.