On the public citation graph

Linear-time snapshot using multi-writer multi-reader registers

https://doi.org/10.1007/bfb0020429

0 signed · 66 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/3-540-56188-9_3openalex-snapshot

Efficient atomic snapshots using lattice agreement

inferredcites →https://doi.org/10.1007/3-540-57271-6_24openalex-snapshot

Binary snapshots

inferredcites →https://doi.org/10.1007/3-540-57271-6_25openalex-snapshot

Linear-time snapshot protocols for unbalanced systems

inferredcites →https://doi.org/10.1007/bfb0035175openalex-snapshot

Time-lapse snapshots

inferredcites →https://doi.org/10.1007/bfb0035176openalex-snapshot

Concurrent Timestamping made simple

inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot

Fast randomized consensus using shared memory

inferredcites →https://doi.org/10.1109/fscs.1990.89524openalex-snapshot

Are wait-free algorithms fast?

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/114005.102808openalex-snapshot

Wait-free synchronization

inferredcites →https://doi.org/10.1145/164051.164055openalex-snapshot

Atomic snapshots in O(n log n) operations

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.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.1007/11947950_35openalex-snapshot

The Complexity of Updating Multi-writer Snapshot Objects

inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_10openalex-snapshot

An Anonymous Wait-Free Weak-Set Object Implementation

inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_18openalex-snapshot

Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers

inferred← citeshttps://doi.org/10.1007/978-3-031-74234-7_17openalex-snapshot

Towards Efficient Runtime Verified Linearizable Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_11openalex-snapshot

The F-Snapshot Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_9openalex-snapshot

Concurrent Use of Write-Once Memory

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_16openalex-snapshot

Help When Needed, But No More: Efficient Read/Write Partial Snapshot

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/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/s00446-003-0093-9openalex-snapshot

Condition-based consensus solvability: a hierarchy of conditions and efficient protocols

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-022-00439-5openalex-snapshot

Long-lived counters with polylogarithmic amortized step complexity

inferred← citeshttps://doi.org/10.1016/j.future.2004.05.005openalex-snapshot

Wait-free computing: an introductory lecture

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.2017.12.001openalex-snapshot

Concurrent use of write-once memory

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.013openalex-snapshot

Linear space bootstrap communication schemes

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00189-0openalex-snapshot

The time complexity of updating snapshot memories

inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00113openalex-snapshot

Fault-tolerant Snapshot Objects in Message Passing Systems

inferred← citeshttps://doi.org/10.1109/ladc.2011.11openalex-snapshot

A Simple Snapshot Algorithm for Multicore Systems

inferred← citeshttps://doi.org/10.1109/srds47363.2019.00046openalex-snapshot

The Notion of Universality in Crash-Prone Asynchronous Message-Passing Systems: A Tutorial

inferred← citeshttps://doi.org/10.1137/s0097539790192647openalex-snapshot

Bounded Concurrent Time-Stamping

inferred← citeshttps://doi.org/10.1145/1011767.1011778openalex-snapshot

Efficient synchronous snapshots

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/1582716.1582728openalex-snapshot

Max registers, counters, and monotone circuits

inferred← citeshttps://doi.org/10.1145/2108242.2108244openalex-snapshot

Polylogarithmic concurrent data structures from monotone circuits

inferred← citeshttps://doi.org/10.1145/2332432.2332458openalex-snapshot

Generalized lattice agreement

inferred← citeshttps://doi.org/10.1145/2332432.2332507openalex-snapshot

Faster than optimal snapshots (for a while)

inferred← citeshttps://doi.org/10.1145/2732263openalex-snapshot

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity

inferred← citeshttps://doi.org/10.1145/277697.277749openalex-snapshot

Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)

inferred← citeshttps://doi.org/10.1145/3154273.3154296openalex-snapshot

Set-Constrained Delivery Broadcast

inferred← citeshttps://doi.org/10.1145/3465084.3467916openalex-snapshot

The Space Complexity of Scannable Binary Objects

inferred← citeshttps://doi.org/10.1145/3465084.3467939openalex-snapshot

An Efficient Adaptive Partial Snapshot Implementation

inferred← citeshttps://doi.org/10.1145/3550483openalex-snapshot

Decentralized Asynchronous Crash-resilient Runtime Verification

inferred← citeshttps://doi.org/10.1145/3583668.3594563openalex-snapshot

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability

inferred← citeshttps://doi.org/10.1145/3777409openalex-snapshot

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability

inferred← citeshttps://doi.org/10.1145/383962.384006openalex-snapshot

A hierarchy of conditions for consensus solvability

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.48550/arxiv.1510.02211openalex-snapshot

The F-snapshot Problem

inferred← citeshttps://doi.org/10.48550/arxiv.1908.10826openalex-snapshot

Strongly Linearizable Implementations of Snapshots and Other Types

inferred← citeshttps://doi.org/10.48550/arxiv.2001.04235openalex-snapshot

Notes on Theory of Distributed Systems

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.