On the public citation graph

Reading many variables in one atomic operation solutions with linear or sublinear complexity

https://doi.org/10.1007/bfb0022450
0 signed · 27 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-54029-6_207openalex-snapshot
Simple atomic snapshots a linear complexity solution with unbounded time-stamps
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1145/2993.357244openalex-snapshot
Real-Time Synchronization of Interprocess Communications
inferredcites →https://doi.org/10.1145/800057.808725openalex-snapshot
Distributed elections in an archimedean ring of processors
inferredcites →https://doi.org/10.1145/93385.93394openalex-snapshot
Atomic snapshots of shared memory
inferredcites →https://doi.org/10.1145/93385.93396openalex-snapshot
Composite registers
inferredcites →https://doi.org/10.1145/97444.97701openalex-snapshot
Wait-free data structures in the asynchronous PRAM model
inferredcites →https://doi.org/10.21236/ada222765openalex-snapshot
Atomic Snapshots of Shared Memory

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.1997.0907openalex-snapshot
Spreading Rumors Rapidly Despite an Adversary
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_3openalex-snapshot
Efficient atomic snapshots using lattice agreement
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_24openalex-snapshot
Binary snapshots
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_25openalex-snapshot
Linear-time snapshot protocols for unbalanced systems
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/3-540-57271-6_27openalex-snapshot
Efficient algorithms for checking the atomicity of a run of read and write operations
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_101openalex-snapshot
How a rainbow coloring function can simulate wait-free handshaking
inferred← citeshttps://doi.org/10.1007/bf01177745openalex-snapshot
Efficient algorithms for checking the atomicity of a run of read and write operations
inferred← citeshttps://doi.org/10.1007/bf01185868openalex-snapshot
Linear-time snapshot implementations in unbalanced systems
inferred← citeshttps://doi.org/10.1007/bf02242714openalex-snapshot
Atomic snapshots using lattice agreement
inferred← citeshttps://doi.org/10.1007/bf02280833openalex-snapshot
Multi-writer composite registers
inferred← citeshttps://doi.org/10.1007/bfb0049407openalex-snapshot
The time complexity of updating snapshot memories
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00189-0openalex-snapshot
The time complexity of updating snapshot memories
inferred← citeshttps://doi.org/10.1145/1060590.1060697openalex-snapshot
An optimal multi-writer snapshot algorithm
inferred← citeshttps://doi.org/10.1145/129712.129776openalex-snapshot
Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!
inferred← citeshttps://doi.org/10.1145/164051.164055openalex-snapshot
Atomic snapshots in O(n log n) operations
inferred← citeshttps://doi.org/10.1145/237814.237869openalex-snapshot
Modular competitiveness for distributed algorithms
inferred← citeshttps://doi.org/10.1145/248052.248077openalex-snapshot
Spreading rumors rapidly despite an adversary
inferred← citeshttps://doi.org/10.1145/324133.324161openalex-snapshot
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
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.