On the public citation graph
Composite registers
0 signed · 110 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-50517-2_87openalex-snapshot
A proof technique for register atomicity
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-54059-8openalex-snapshot
Advanced Information Systems Engineering
inferredcites →https://doi.org/10.1007/bfb0022437openalex-snapshot
Pseudo read-modify-write operations: Bounded wait-free implementations
inferredcites →https://doi.org/10.1007/bfb0035779openalex-snapshot
How to share concurrent asynchronous wait-free variables
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.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/362759.362813openalex-snapshot
Concurrent control with “readers” and “writers”
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
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/5001.5007openalex-snapshot
Axioms for memory access in asynchronous hardware systems
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/97444.97701openalex-snapshot
Wait-free data structures in the asynchronous PRAM model
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.4380250403openalex-snapshot
Implementation of the sentry system
inferred← citeshttps://doi.org/10.1006/jagm.1998.0969openalex-snapshot
The Instancy of Snapshots and Commuting Objects
inferred← citeshttps://doi.org/10.1007/11561927_19openalex-snapshot
What Can Be Implemented Anonymously?
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/978-0-387-30162-4_380openalex-snapshot
Snapshots in Shared Memory
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_380openalex-snapshot
Snapshots in Shared Memory
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-319-14472-6_26openalex-snapshot
Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_4openalex-snapshot
An $O(\sqrt n)$ Space Bound for Obstruction-Free Leader Election
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_29openalex-snapshot
From Geometric Semantics to Asynchronous Computability
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/bfb0049407openalex-snapshot
The time complexity of updating snapshot memories
inferred← citeshttps://doi.org/10.1007/s002360050010openalex-snapshot
Efficient algorithms for checking the atomicity of a run of read and write operations
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-007-0042-0openalex-snapshot
Anonymous and fault-tolerant shared-memory computing
inferred← citeshttps://doi.org/10.1007/s00446-016-0286-7openalex-snapshot
Lower and upper bounds for single-scanner snapshot implementations
inferred← citeshttps://doi.org/10.1007/s00446-018-0328-4openalex-snapshot
Geometric and combinatorial views on asynchronous computability
inferred← citeshttps://doi.org/10.1007/s00446-022-00439-5openalex-snapshot
Long-lived counters with polylogarithmic amortized step complexity
inferred← citeshttps://doi.org/10.1007/s004460050039openalex-snapshot
Using local-spin k -exclusion algorithms to improve wait-free object implementations
inferred← citeshttps://doi.org/10.1007/s004460050045openalex-snapshot
Randomized naming using wait-free shared variables
inferred← citeshttps://doi.org/10.1016/b978-0-12-415950-1.00013-6openalex-snapshot
Foundations of shared memory
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/c2011-0-07032-1openalex-snapshot
Distributed Computing Through Combinatorial Topology
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.06.004openalex-snapshot
Compositional competitiveness for distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.08.002openalex-snapshot
The complexity of updating snapshot objects
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.05.002openalex-snapshot
WFR-TM: Wait-free readers without sacrificing speculation of writers
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00189-0openalex-snapshot
The time complexity of updating snapshot memories
inferred← citeshttps://doi.org/10.1051/ita/1997310200971openalex-snapshot
Introduction à l'algorithmique des objets partagés
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00075openalex-snapshot
Byzantine Generalized Lattice Agreement
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00113openalex-snapshot
Fault-tolerant Snapshot Objects in Message Passing Systems
inferred← citeshttps://doi.org/10.1109/rtcsa.1998.726426openalex-snapshot
Wait-free snapshots in real-time systems: algorithms and performance
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892333openalex-snapshot
On the existence of booster types
inferred← citeshttps://doi.org/10.1137/s0097539795279463openalex-snapshot
Atomic Snapshots in O ( n log n ) Operations
inferred← citeshttps://doi.org/10.1137/s0097539796307698openalex-snapshot
Wait-Free k -Set Agreement is Impossible: The Topology of Public Knowledge
inferred← citeshttps://doi.org/10.1137/s0097539797317299openalex-snapshot
Time and Space Lower Bounds for Nonblocking Implementations
inferred← citeshttps://doi.org/10.1137/s0097539797329439openalex-snapshot
Determining Consensus Numbers
inferred← citeshttps://doi.org/10.1145/1007352.1007406openalex-snapshot
Collective asynchronous reading with polylogarithmic worst-case overhead
inferred← citeshttps://doi.org/10.1145/1011767.1011778openalex-snapshot
Efficient synchronous snapshots
inferred← citeshttps://doi.org/10.1145/1060590.1060697openalex-snapshot
An optimal multi-writer snapshot algorithm
inferred← citeshttps://doi.org/10.1145/1132516.1132542openalex-snapshot
Time-space tradeoffs for implementations of snapshots
inferred← citeshttps://doi.org/10.1145/1146381.1146416openalex-snapshot
Single-scanner multi-writer snapshot implementations are fast!
inferred← citeshttps://doi.org/10.1145/1281100.1281108openalex-snapshot
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS
inferred← citeshttps://doi.org/10.1145/1314690.1314694openalex-snapshot
Time lower bounds for implementations of multi-writer snapshots
inferred← citeshttps://doi.org/10.1145/164051.164055openalex-snapshot
Atomic snapshots in O(n log n) operations
inferred← citeshttps://doi.org/10.1145/167088.167122openalex-snapshot
Wait-free k -set agreement is impossible
inferred← citeshttps://doi.org/10.1145/167088.167125openalex-snapshot
The asynchronous computability theorem for t -resilient tasks
inferred← citeshttps://doi.org/10.1145/200836.200869openalex-snapshot
Sharing memory robustly in message-passing systems
inferred← citeshttps://doi.org/10.1145/2108242.2108244openalex-snapshot
Polylogarithmic concurrent data structures from monotone circuits
inferred← citeshttps://doi.org/10.1145/2332432.2332507openalex-snapshot
Faster than optimal snapshots (for a while)
inferred← citeshttps://doi.org/10.1145/234533.234556openalex-snapshot
How to share concurrent wait-free variables
inferred← citeshttps://doi.org/10.1145/248052.248096openalex-snapshot
The power of multi-objects (extended abstract)
inferred← citeshttps://doi.org/10.1145/259380.259440openalex-snapshot
Towards a topological characterization of asynchronous complexity
inferred← citeshttps://doi.org/10.1145/2732263openalex-snapshot
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
inferred← citeshttps://doi.org/10.1145/3382734.3406005openalex-snapshot
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity
inferred← citeshttps://doi.org/10.1145/3519270.3538420openalex-snapshot
The Space Complexity of Consensus from Swap
inferred← citeshttps://doi.org/10.1145/3583668.3594601openalex-snapshot
Efficient Bounded Timestamping from Standard Synchronization Primitives
inferred← citeshttps://doi.org/10.1145/3631390openalex-snapshot
The Space Complexity of Consensus from Swap
inferred← citeshttps://doi.org/10.1145/3662158.3662820openalex-snapshot
MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-Memory
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.1145/3746238.3746244openalex-snapshot
MemSnap: Checkpointing Modern Shared-Memory (Abstract)
inferred← citeshttps://doi.org/10.1145/571825.571828openalex-snapshot
Space-optimal multi-writer snapshot objects are slow
inferred← citeshttps://doi.org/10.1145/780542.780582openalex-snapshot
A tight time lower bound for space-optimal implementations of multi-writer snapshots
inferred← citeshttps://doi.org/10.1349/ddlp.3430openalex-snapshot
On the complexity of implementing certain classes of shared objects.
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02991openalex-snapshot
Simple Executions of Snapshot Implementations
inferred← citeshttps://doi.org/10.48550/arxiv.2008.11837openalex-snapshot
Amortized Constant Round Atomic Snapshot in Message-Passing Systems
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.