On the public citation graph

Time-lapse snapshots

https://doi.org/10.1007/bfb0035175
0 signed · 68 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-51687-5_51openalex-snapshot
How to construct an atomic variable (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-56188-9_7openalex-snapshot
A concurrent time-stamp scheme which is linear in time and space
inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1109/71.296315openalex-snapshot
Reading many variables in one atomic operation: solutions with linear or sublinear complexity
inferredcites →https://doi.org/10.1109/fscs.1990.89524openalex-snapshot
Are wait-free algorithms fast?
inferredcites →https://doi.org/10.1109/sfcs.1987.10openalex-snapshot
Bounded time-stamps
inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot
Wait-free synchronization
inferredcites →https://doi.org/10.1145/129712.129776openalex-snapshot
Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!
inferredcites →https://doi.org/10.1145/153724.153741openalex-snapshot
Atomic snapshots of shared memory
inferredcites →https://doi.org/10.1145/214451.214456openalex-snapshot
Distributed snapshots
inferredcites →https://doi.org/10.1145/357195.357198openalex-snapshot
Concurrent Reading While Writing
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/359863.359878openalex-snapshot
Concurrent reading and writing
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
inferredcites →https://doi.org/10.1145/41840.41859openalex-snapshot
Constructing multi-reader atomic values from non-atomic values
inferredcites →https://doi.org/10.1145/5383.5384openalex-snapshot
The mutual exclusion problem
inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot
On achieving consensus using a shared memory
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/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
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/93385.93433openalex-snapshot
Time-and space-efficient randomized consensus
inferredcites →https://doi.org/10.1145/97444.97701openalex-snapshot
Wait-free data structures in the asynchronous PRAM model
inferredcites →https://doi.org/10.21236/ada213853openalex-snapshot
Bounded Concurrent Time-Stamp Systems Are Constructible
inferredcites →https://doi.org/10.5555/127787.127853openalex-snapshot
Optimal time randomized consensus—making resilient algorithms fast in practice

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-56188-9_7openalex-snapshot
A concurrent time-stamp scheme which is linear in time and space
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-58338-6_101openalex-snapshot
How a rainbow coloring function can simulate wait-free handshaking
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_21openalex-snapshot
On Composition and Implementation of Sequential Consistency
inferred← citeshttps://doi.org/10.1007/bf01185868openalex-snapshot
Linear-time snapshot implementations in unbalanced systems
inferred← citeshttps://doi.org/10.1007/bf02242708openalex-snapshot
Bounded time-stamps
inferred← citeshttps://doi.org/10.1007/bf02242714openalex-snapshot
Atomic snapshots using lattice agreement
inferred← citeshttps://doi.org/10.1007/bfb0020429openalex-snapshot
Linear-time snapshot using multi-writer multi-reader registers
inferred← citeshttps://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/bfb0030673openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study
inferred← citeshttps://doi.org/10.1007/bfb0049407openalex-snapshot
The time complexity of updating snapshot memories
inferred← citeshttps://doi.org/10.1007/pl00008917openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00198-0openalex-snapshot
Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00189-0openalex-snapshot
The time complexity of updating snapshot memories
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00325-xopenalex-snapshot
Self-stabilizing ℓ-exclusion
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00412-6openalex-snapshot
Towards a practical snapshot algorithm
inferred← citeshttps://doi.org/10.1109/istcs.1995.377039openalex-snapshot
Towards a practical snapshot algorithm
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267810openalex-snapshot
Randomized consensus in expected O(n log/sup 2/ n) operations per processor
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365676openalex-snapshot
A theory of competitive analysis for distributed algorithms
inferred← citeshttps://doi.org/10.1137/s0097539790192647openalex-snapshot
Bounded Concurrent Time-Stamping
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/164051.164058openalex-snapshot
Bounded round number
inferred← citeshttps://doi.org/10.1145/164051.164078openalex-snapshot
On the space complexity of randomized synchronization
inferred← citeshttps://doi.org/10.1145/167088.167145openalex-snapshot
Contention in shared memory algorithms
inferred← citeshttps://doi.org/10.1145/177492.177731openalex-snapshot
A bounded first-in, first-enabled solution to the l -exclusion problem
inferred← citeshttps://doi.org/10.1145/234533.234556openalex-snapshot
How to share concurrent wait-free variables
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/258533.258649openalex-snapshot
Lower bounds for distributed coin-flipping and randomized consensus
inferred← citeshttps://doi.org/10.1145/268999.269000openalex-snapshot
Contention in shared memory algorithms
inferred← citeshttps://doi.org/10.1145/278298.278304openalex-snapshot
Lower bounds for distributed coin-flipping and randomized consensus
inferred← citeshttps://doi.org/10.1145/290179.290183openalex-snapshot
On the space complexity of randomized synchronization
inferred← citeshttps://doi.org/10.1145/3694906.3743345openalex-snapshot
Δ-Snap: Snapshotting the Differential
inferred← citeshttps://doi.org/10.1145/3732772.3733542openalex-snapshot
A Shared Archive of Snapshots
inferred← citeshttps://doi.org/10.48550/arxiv.1607.05596openalex-snapshot
On Composition and Implementation of Sequential Consistency (Extended Version)
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.