On the public citation graph

Partial snapshot objects

0 signed · 57 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.1006/jagm.1993.1022openalex-snapshot

Time- and Space-Efficient Randomized Consensus

inferredcites →https://doi.org/10.1007/11864219_14openalex-snapshot

Transactional Locking II

inferredcites →https://doi.org/10.1007/11864219_20openalex-snapshot

A Lazy Snapshot Algorithm with Eager Validation

inferredcites →https://doi.org/10.1007/978-3-540-30577-4_3openalex-snapshot

How Hard Is It to Take a Snapshot?

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

Composite registers

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

Atomic snapshots using lattice agreement

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

Concurrent Timestamping made simple

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

Software transactional memory

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

Fast randomized consensus using shared memory

inferredcites →https://doi.org/10.1016/s0304-3975(00)00412-6openalex-snapshot

Towards a practical snapshot algorithm

inferredcites →https://doi.org/10.1016/s1571-0661(04)81017-xopenalex-snapshot

Space- and Time-adaptive Nonblocking Algorithms

inferredcites →https://doi.org/10.1109/sffcs.1999.814598openalex-snapshot

Long-lived adaptive collect with applications

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

An optimal multi-writer snapshot algorithm

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

Randomized wait-free concurrent objects (extended abstract)

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

Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS

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

Atomic snapshots of shared memory

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

Transactional memory

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

Are wait-free algorithms fast?

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

Wait-free made fast

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

Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)

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

f -arrays

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

Algorithms adapting to point contention

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.5281/zenodo.1245968openalex-extracted

inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_8openalex-snapshot

Exploring Trade-Offs in Partial Snapshot Implementations

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

A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness

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-11476-2_21openalex-snapshot

A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition

inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_31openalex-snapshot

On Adaptive Renaming under Eventually Limited Contention

inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_20openalex-snapshot

Fork-Consistent Constructions from Registers

inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_3openalex-snapshot

Range Queries in Non-blocking k-ary Search Trees

inferred← citeshttps://doi.org/10.1007/s00224-010-9304-5openalex-snapshot

Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory

inferred← citeshttps://doi.org/10.1007/s00224-013-9491-yopenalex-snapshot

Highly-Efficient Wait-Free Synchronization

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.tcs.2012.04.037openalex-snapshot

Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations)

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.1109/ladc.2011.11openalex-snapshot

A Simple Snapshot Algorithm for Multicore Systems

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

Inherent limitations on disjoint-access parallel implementations of transactional memory

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

A highly-efficient wait-free universal construction

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

Fork-consistent constructions from registers

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

Concurrent updates with RCU

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

Lock-free Linearizable 1-Dimensional Range Queries

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

Harnessing epoch-based reclamation for efficient range queries

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

Harnessing epoch-based reclamation for efficient range queries

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

Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries

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

An Efficient Adaptive Partial Snapshot Implementation

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

Auditing without Leaks Despite Curiosity

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

A Shared Archive of Snapshots

inferred← citeshttps://doi.org/10.26083/tuprints-00003109openalex-snapshot

Data Consistency and Coordination for Untrusted Environments

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

Range Queries in Non-blocking $k$-ary Search Trees

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

Efficient Partial Snapshot Implementations

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

Constant-Time Snapshots with Applications to Concurrent Data Structures

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.