On the public citation graph
Multi-writer composite registers
0 signed · 118 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-54029-6_207openalex-snapshot
Simple atomic snapshots a linear complexity solution with unbounded time-stamps
inferredcites →https://doi.org/10.1007/3-540-57271-6_26openalex-snapshot
Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract)
inferredcites →https://doi.org/10.1007/bfb0022437openalex-snapshot
Pseudo read-modify-write operations: Bounded wait-free implementations
inferredcites →https://doi.org/10.1007/bfb0022450openalex-snapshot
Reading many variables in one atomic operation solutions with linear or sublinear complexity
inferredcites →https://doi.org/10.1007/bfb0035779openalex-snapshot
How to share concurrent asynchronous wait-free variables
inferredcites →https://doi.org/10.1016/0141-9331(89)90152-xopenalex-snapshot
Parallel program design: a foundation
inferredcites →https://doi.org/10.1016/0167-6423(92)90036-bopenalex-snapshot
Beyond atomic registers: bounded wait-free implementations of nontrivial objects
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/153724.153741openalex-snapshot
Atomic snapshots of shared memory
inferredcites →https://doi.org/10.1145/164051.164055openalex-snapshot
Atomic snapshots in O(n log n) operations
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.1007/11947950_35openalex-snapshot
The Complexity of Updating Multi-writer Snapshot Objects
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_8openalex-snapshot
Simple Wait-Free Multireader Registers
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-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-03232-6_18openalex-snapshot
Set Agreement and Renaming in the Presence of Contention-Related Crash Failures
inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_9openalex-snapshot
Anonymity in Distributed Read/Write Systems: An Introductory Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-25636-4_33openalex-snapshot
Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector
inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_8openalex-snapshot
Self-stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_20openalex-snapshot
Fully Anonymous Consensus and Set Agreement Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-81404-4_3openalex-snapshot
Invited Paper: Distributed Computability: A Few Results Masters Students Should Know
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_20openalex-snapshot
Of Concurrent Data Structures and Iterations
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_12openalex-snapshot
t-Resilient Immediate Snapshot Is Impossible
inferred← citeshttps://doi.org/10.1007/978-3-319-49583-5_26openalex-snapshot
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_3openalex-snapshot
How Hard Is It to Take a Snapshot?
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_11openalex-snapshot
Interrupting Snapshots and the Java $^{\mbox{\tiny TM}}$ Size() Method
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_16openalex-snapshot
Help When Needed, But No More: Efficient Read/Write Partial Snapshot
inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_3openalex-snapshot
A Survey on Some Recent Advances in Shared Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_16openalex-snapshot
Lock-Free Data-Structure Iterators
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_18openalex-snapshot
Atomic Snapshots in O(log3 n) Steps Using Randomized Helping
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_19openalex-snapshot
Adaptive Register Allocation with a Linear Number of Registers
inferred← citeshttps://doi.org/10.1007/bfb0022437openalex-snapshot
Pseudo read-modify-write operations: Bounded wait-free implementations
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/s004460200071openalex-snapshot
Randomized two-process wait-free test-and-set
inferred← citeshttps://doi.org/10.1016/0167-6423(92)90036-bopenalex-snapshot
Beyond atomic registers: bounded wait-free implementations of nontrivial objects
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/j.jpdc.2011.08.002openalex-snapshot
The complexity of updating snapshot objects
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.08.005openalex-snapshot
Help when needed, but no more: Efficient read/write partial snapshot
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.03.007openalex-snapshot
Interrupting snapshots and the Java size method
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/j.tcs.2013.03.002openalex-snapshot
Power and limits of distributed computing shared memory models
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.013openalex-snapshot
Linear space bootstrap communication schemes
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.044openalex-snapshot
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.029openalex-snapshot
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115929openalex-snapshot
Self-stabilizing snapshot objects for asynchronous failure-prone networked systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00412-6openalex-snapshot
Towards a practical snapshot algorithm
inferred← citeshttps://doi.org/10.1049/ip-cdt:19971220openalex-snapshot
Multireader and multiwriter asynchronous communication mechanisms
inferred← citeshttps://doi.org/10.1109/ipdps.2015.84openalex-snapshot
A Consistency Framework for Iteration Operations in Concurrent Data Structures
inferred← citeshttps://doi.org/10.1109/istcs.1995.377039openalex-snapshot
Towards a practical snapshot algorithm
inferred← citeshttps://doi.org/10.1109/ladc.2011.11openalex-snapshot
A Simple Snapshot Algorithm for Multicore 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.2005.47openalex-snapshot
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
inferred← citeshttps://doi.org/10.1137/08072646xopenalex-snapshot
On the Inherent Sequentiality of Concurrent Objects
inferred← citeshttps://doi.org/10.1137/20m1322923openalex-snapshot
Revisionist Simulations: A New Approach to Proving Space Lower Bounds
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/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/1281100.1281151openalex-snapshot
The complexity of updating multi-writer snapshot objects
inferred← citeshttps://doi.org/10.1145/1314690.1314694openalex-snapshot
Time lower bounds for implementations of multi-writer snapshots
inferred← citeshttps://doi.org/10.1145/153724.153741openalex-snapshot
Atomic snapshots of shared memory
inferred← citeshttps://doi.org/10.1145/2421096.2421117openalex-snapshot
Distributed computing column 47
inferred← citeshttps://doi.org/10.1145/2421096.2421118openalex-snapshot
Computability in distributed computing
inferred← citeshttps://doi.org/10.1145/248052.248096openalex-snapshot
The power of multi-objects (extended abstract)
inferred← citeshttps://doi.org/10.1145/3154273.3154296openalex-snapshot
Set-Constrained Delivery Broadcast
inferred← citeshttps://doi.org/10.1145/3293611.3331584openalex-snapshot
Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems
inferred← citeshttps://doi.org/10.1145/3293611.3331594openalex-snapshot
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
inferred← citeshttps://doi.org/10.1145/3437801.3441602openalex-snapshot
Constant-time snapshots with applications to concurrent data structures
inferred← citeshttps://doi.org/10.1145/3465084.3467916openalex-snapshot
The Space Complexity of Scannable Binary Objects
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/3732772.3733542openalex-snapshot
A Shared Archive of Snapshots
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.1145/792538.792541openalex-snapshot
Algorithms adapting to point contention
inferred← citeshttps://doi.org/10.1145/93385.93394openalex-snapshot
Atomic snapshots of shared memory
inferred← citeshttps://doi.org/10.2200/s01165ed1v01y202202dct018openalex-snapshot
Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions
inferred← citeshttps://doi.org/10.37652/juaps.2009.15638openalex-snapshot
Design and Implementation of Virtual Grid-Based Parallel Computer (VGBPC)
inferred← citeshttps://doi.org/10.48456/tr-697openalex-snapshot
Scaling Mount Concurrency: scalability and progress in concurrent algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06033openalex-snapshot
Deterministic and Fast Randomized Test-and-Set in Optimal Space
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06420openalex-snapshot
Self-Stabilizing Snapshot Objects for Asynchronous Fail-Prone Network Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04235openalex-snapshot
Notes on Theory of Distributed Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2007.02372openalex-snapshot
Constant-Time Snapshots with Applications to Concurrent Data Structures
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00096openalex-snapshot
$t$-Resilient $k$-Immediate Snapshot and its Relation with Agreement Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0202003openalex-snapshot
Simple Optimal Wait-free Multireader Registers
inferred← citeshttps://doi.org/10.70675/8959a3cbz6b0dz4180z8fe6zce4c09a3a8b5openalex-snapshot
Data structures for current multi-core and future many-core architectures
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.