On the public citation graph
Initial failures in distributed computations
0 signed · 38 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-51687-5_48openalex-snapshot
Possibility and impossibility results in a shared memory environment
inferredcites →https://doi.org/10.1007/3-540-52048-1_37openalex-snapshot
Impossibility results in the presence of multiple faulty processes
inferredcites →https://doi.org/10.1007/bfb0039625openalex-snapshot
Making distributed spanning tree algorithms fault-resilient
inferredcites →https://doi.org/10.1016/0020-0190(87)90052-4openalex-snapshot
Extended impossibility results for asynchronous complete networks
inferredcites →https://doi.org/10.1016/0020-0190(88)90023-3openalex-snapshot
Effects of message loss on the termination of distributed protocols
inferredcites →https://doi.org/10.1109/12.2189openalex-snapshot
Fault-tolerant distributed algorithm for election in complete networks
inferredcites →https://doi.org/10.1109/sfcs.1987.5openalex-snapshot
Achievable cases in an asynchronous environment
inferredcites →https://doi.org/10.1109/sfcs.1989.63513openalex-snapshot
Solvability in asynchronous environments
inferredcites →https://doi.org/10.1145/28659.28672openalex-snapshot
A knowledge-theoretic analysis of atomic commitment protocols
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/41840.41845openalex-snapshot
Fault-tolerant decision making in totally asynchronous distributed systems
inferredcites →https://doi.org/10.1145/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferredcites →https://doi.org/10.1145/62546.62590openalex-snapshot
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/800222.806747openalex-snapshot
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1068openalex-snapshot
Impossibility Results in the Presence of Multiple Faulty Processes
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_1openalex-snapshot
Lower Bounds in Distributed Computing
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_48openalex-snapshot
Possibility and impossibility results in a shared memory environment
inferred← citeshttps://doi.org/10.1007/3-540-52048-1_37openalex-snapshot
Impossibility results in the presence of multiple faulty processes
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_25openalex-snapshot
Tight bounds on the round complexity of distributed 1-solvable tasks
inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_4openalex-snapshot
Weak Failures: Definitions, Algorithms and Impossibility Results
inferred← citeshttps://doi.org/10.1007/978-3-031-21017-4_13openalex-snapshot
Reaching Consensus in the Presence of Contention-Related Crash Failures
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_13openalex-snapshot
Better Sooner Rather Than Later
inferred← citeshttps://doi.org/10.1007/s002360050034openalex-snapshot
Possibility and impossibility results in a shared memory environment
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-014-0238-zopenalex-snapshot
Simple and optimal randomized fault-tolerant rumor spreading
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00157-eopenalex-snapshot
Tight bounds on the round complexity of distributed 1-solvable tasks
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.029openalex-snapshot
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113982openalex-snapshot
Reaching agreement in the presence of contention-related crash failures
inferred← citeshttps://doi.org/10.1137/s0097539795294979openalex-snapshot
Solvability in Asynchronous Environments II: Finite Interactive Tasks
inferred← citeshttps://doi.org/10.1145/258533.258652openalex-snapshot
The decidability of distributed decision tasks (extended abstract)
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0412115openalex-snapshot
Reductions in Distributed Computing Part I: Consensus and Atomic Commitment Tasks
inferred← citeshttps://doi.org/10.7146/dpb.v20i377.6609openalex-snapshot
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
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.