On the public citation graph

How to share concurrent asynchronous wait-free variables

https://doi.org/10.1007/bfb0035779
0 signed · 35 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/3-540-50517-2_87openalex-snapshot
A proof technique for register atomicity
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1007/bfb0019809openalex-snapshot
Atomic multireader register
inferredcites →https://doi.org/10.1007/bfb0035779openalex-snapshot
How to share concurrent asynchronous wait-free variables
inferredcites →https://doi.org/10.1016/0020-0190(88)90175-5openalex-snapshot
Converting Lamport's regular register to atomic register
inferredcites →https://doi.org/10.1109/12.9729openalex-snapshot
Constructing two-writer atomic registers
inferredcites →https://doi.org/10.1109/sfcs.1986.11openalex-snapshot
Atomic shared register access by asynchronous hardware
inferredcites →https://doi.org/10.1109/sfcs.1987.10openalex-snapshot
Bounded time-stamps
inferredcites →https://doi.org/10.1109/sfcs.1987.15openalex-snapshot
Concurrent reading while writing II: The multi-writer case
inferredcites →https://doi.org/10.1145/357195.357198openalex-snapshot
Concurrent Reading While Writing
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/41840.41858openalex-snapshot
The elusive atomic register revisited
inferredcites →https://doi.org/10.1145/41840.41859openalex-snapshot
Constructing multi-reader atomic values from non-atomic values
inferredcites →https://doi.org/10.1145/41840.41860openalex-snapshot
A protocol for wait-free, atomic, multi-reader shared variables
inferredcites →https://doi.org/10.1145/62546.62593openalex-snapshot
Impossibility and universality results for wait-free synchronization
inferredcites →https://doi.org/10.1145/73007.73051openalex-snapshot
Bounded concurrrent 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/inco.1993.1052openalex-snapshot
Asynchronous Mappings and Asynchronous Cellular Automata
inferred← citeshttps://doi.org/10.1006/jagm.1998.1000openalex-snapshot
Optimal Space Distributed Order-Preserving Lists
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_21openalex-snapshot
The granularity of waiting (extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_24openalex-snapshot
Binary snapshots
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_26openalex-snapshot
Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_8openalex-snapshot
Applications of Kolmogorov Complexity in the Theory of Computation
inferred← citeshttps://doi.org/10.1007/978-1-4615-4016-8_5openalex-snapshot
Theory of Real-Time Systems — Project Survey
inferred← citeshttps://doi.org/10.1007/bf01212305openalex-snapshot
A criterion for atomicity
inferred← citeshttps://doi.org/10.1007/bf02242703openalex-snapshot
Composite registers
inferred← citeshttps://doi.org/10.1007/bf02280833openalex-snapshot
Multi-writer composite registers
inferred← citeshttps://doi.org/10.1007/s002360050040openalex-snapshot
Simple extensions of 1-writer atomic variable constructions to multiwriter ones
inferred← citeshttps://doi.org/10.1007/s004460050031openalex-snapshot
Keeping track of the latest gossip in a distributed system
inferred← citeshttps://doi.org/10.1145/112600.112607openalex-snapshot
Optimal space distributed move-to-front lists
inferred← citeshttps://doi.org/10.1145/174652.174657openalex-snapshot
The elusive atomic register
inferred← citeshttps://doi.org/10.1145/179812.179902openalex-snapshot
Are wait-free algorithms fast?
inferred← citeshttps://doi.org/10.1145/227683.227688openalex-snapshot
Computing with faulty shared objects
inferred← citeshttps://doi.org/10.1145/234533.234556openalex-snapshot
How to share concurrent wait-free variables
inferred← citeshttps://doi.org/10.1145/93385.93441openalex-snapshot
Sharing memory robustly in message-passing systems
showing the first 18 of 19 · page through all 19
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.