On the public citation graph
A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
0 signed · 42 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-12689-9_99openalex-snapshot
The consensus problem in unreliable distributed systems (a brief survey)
inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1109/sfcs.1986.20openalex-snapshot
Flipping persuasively in constant expected time
inferredcites →https://doi.org/10.1109/sfcs.1989.63513openalex-snapshot
Solvability in asynchronous environments
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/41840.41845openalex-snapshot
Fault-tolerant decision making in totally asynchronous distributed systems
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
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/62546.62593openalex-snapshot
Impossibility and universality results for wait-free synchronization
inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot
On achieving consensus using a shared memory
inferredcites →https://doi.org/10.1145/65950.65956openalex-snapshot
Simple constant-time consensus protocols in realistic failure models
inferredcites →https://doi.org/10.1145/72981.73001openalex-snapshot
Bounded polynomial randomized consensus
inferredcites →https://doi.org/10.1145/73007.73051openalex-snapshot
Bounded concurrrent time-stamp systems are constructible
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/79147.79158openalex-snapshot
Renaming in an asynchronous environment
inferredcites →https://doi.org/10.1145/800221.806707openalex-snapshot
Another advantage of free choice (Extended Abstract)
inferredcites →https://doi.org/10.21236/ada213808openalex-snapshot
Bounded Polynomial Randomized Consensus
inferredcites →https://doi.org/10.21236/ada213853openalex-snapshot
Bounded Concurrent Time-Stamp Systems Are Constructible
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1999.1025openalex-snapshot
Efficient and Robust Sharing of Memory in Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/11864219_2openalex-snapshot
Renaming in Message Passing Systems with Byzantine Failures
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_10openalex-snapshot
Polynomial and Adaptive Long-lived (2k- 1)-Renaming
inferred← citeshttps://doi.org/10.1007/3-540-61769-8_5openalex-snapshot
Efficient and robust sharing of memory in message-passing systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40148-0_12openalex-snapshot
Distributed B-Tree with Weak Consistency
inferred← citeshttps://doi.org/10.1007/s00446-007-0045-xopenalex-snapshot
Renaming in synchronous message passing systems with Byzantine failures
inferred← citeshttps://doi.org/10.1007/s004460200071openalex-snapshot
Randomized two-process wait-free test-and-set
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.06.001openalex-snapshot
Strong order-preserving renaming in the synchronous message passing model
inferred← citeshttps://doi.org/10.1137/s0097539700366000openalex-snapshot
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
inferred← citeshttps://doi.org/10.1137/s0097539793255527openalex-snapshot
Performing Work Efficiently in the Presence of Faults
inferred← citeshttps://doi.org/10.1137/s0097539795294979openalex-snapshot
Solvability in Asynchronous Environments II: Finite Interactive Tasks
inferred← citeshttps://doi.org/10.1145/135419.135439openalex-snapshot
Performing work efficiently in the presence of faults
inferred← citeshttps://doi.org/10.1145/301308.301335openalex-snapshot
Long-lived renaming made adaptive
inferred← citeshttps://doi.org/10.20381/ruor-5380openalex-snapshot
Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.16openalex-snapshot
Optimal Resilience in Systems That Mix Shared Memory and Message Passing
inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
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.