On the public citation graph
Every data structure deserves lock-free memory reclamation
0 signed · 63 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-45414-4_21openalex-snapshot
A Pragmatic Implementation of Non-blocking Linked-lists
inferredcites →https://doi.org/10.1007/978-3-319-43659-3_34openalex-snapshot
CBPQ: High Performance Lock-Free Priority Queue
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1016/j.jpdc.2007.04.010openalex-snapshot
Performance of memory reclamation for lockless synchronization
inferredcites →https://doi.org/10.1109/71.139204openalex-snapshot
Lock-free garbage collection for multiprocessors
inferredcites →https://doi.org/10.1109/tpds.2004.8openalex-snapshot
Hazard pointers: safe memory reclamation for lock-free objects
inferredcites →https://doi.org/10.1145/1375581.1375587openalex-snapshot
A study of concurrent real-time garbage collectors
inferredcites →https://doi.org/10.1145/1379022.1375587openalex-snapshot
A study of concurrent real-time garbage collectors
inferredcites →https://doi.org/10.1145/1941553.1941585openalex-snapshot
Wait-free queues with multiple enqueuers and dequeuers
inferredcites →https://doi.org/10.1145/1989493.1989549openalex-snapshot
A highly-efficient wait-free universal construction
inferredcites →https://doi.org/10.1145/2145816.2145835openalex-snapshot
A methodology for creating fast wait-free data structures
inferredcites →https://doi.org/10.1145/2247684.2247685openalex-snapshot
Can parallel data structures rely on automatic memory managers?
inferredcites →https://doi.org/10.1145/2247684.2247688openalex-snapshot
Can seqlocks get along with programming language memory models?
inferredcites →https://doi.org/10.1145/224964.224988openalex-snapshot
Lock-free linked lists using compare-and-swap
inferredcites →https://doi.org/10.1145/2555243.2555261openalex-snapshot
A practical wait-free simulation for lock-free data structures
inferredcites →https://doi.org/10.1145/2755573.2755579openalex-snapshot
Efficient Memory Management for Lock-Free Data Structures with Optimistic Access
inferredcites →https://doi.org/10.1145/2767386.2767436openalex-snapshot
Reclaiming Memory for Lock-Free Data Structures
inferredcites →https://doi.org/10.1145/2814270.2814298openalex-snapshot
Automatic memory reclamation for lock-free data structures
inferredcites →https://doi.org/10.1145/2851141.2851168openalex-snapshot
A wait-free queue as fast as fetch-and-add
inferredcites →https://doi.org/10.1145/2926697.2926699openalex-snapshot
Fast non-intrusive memory reclamation for highly-concurrent data structures
inferredcites →https://doi.org/10.1145/2935764.2935790openalex-snapshot
Fast and Robust Memory Reclamation for Concurrent Data Structures
inferredcites →https://doi.org/10.1145/3178487.3178488openalex-snapshot
Interval-based memory reclamation
inferredcites →https://doi.org/10.1145/564870.564881openalex-snapshot
High performance dynamic lock-free hash tables and list-based sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.04.007openalex-snapshot
On the implementation of memory reclamation methods in a lock-free hash trie design
inferred← citeshttps://doi.org/10.1109/access.2025.3569072openalex-snapshot
TSC-IBR: A Variant of Interval-Based Memory Reclamation Using CPU’s Time-Stamp Counter
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00021openalex-snapshot
Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures
inferred← citeshttps://doi.org/10.1109/tpds.2021.3097901openalex-snapshot
Fast and Portable Concurrent FIFO Queues With Deterministic Memory Reclamation
inferred← citeshttps://doi.org/10.1109/tpds.2023.3335671openalex-snapshot
Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization
inferred← citeshttps://doi.org/10.1145/3293611.3331575openalex-snapshot
Hyaline: Fast and Transparent Lock-Free Memory Reclamation
inferred← citeshttps://doi.org/10.1145/3332466.3374540openalex-snapshot
Universal wait-free memory reclamation
inferred← citeshttps://doi.org/10.1145/3371136openalex-snapshot
Pointer life cycle types for lock-free data structures with memory reclamation
inferred← citeshttps://doi.org/10.1145/3385412.3385978openalex-snapshot
A marriage of pointer- and epoch-based reclamation
inferred← citeshttps://doi.org/10.1145/3437801.3441582openalex-snapshot
Efficiently reclaiming memory in concurrent search data structures while bounding wasted memory
inferred← citeshttps://doi.org/10.1145/3453483.3454060openalex-snapshot
Concurrent deferred reference counting with constant-time overhead
inferred← citeshttps://doi.org/10.1145/3453483.3454090openalex-snapshot
Snapshot-free, transparent, and robust memory reclamation for lock-free data structures
inferred← citeshttps://doi.org/10.1145/3558481.3591089openalex-snapshot
Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs
inferred← citeshttps://doi.org/10.1145/3558481.3591102openalex-snapshot
Applying Hazard Pointers to More Concurrent Data Structures
inferred← citeshttps://doi.org/10.1145/3572848.3577491openalex-snapshot
The ERA Theorem for Safe Memory Reclamation
inferred← citeshttps://doi.org/10.1145/3583668.3594564openalex-snapshot
The ERA Theorem for Safe Memory Reclamation
inferred← citeshttps://doi.org/10.1145/3658851openalex-snapshot
A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation
inferred← citeshttps://doi.org/10.1145/3710848.3710890openalex-snapshot
Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures
inferred← citeshttps://doi.org/10.1145/3729337openalex-snapshot
RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures
inferred← citeshttps://doi.org/10.1145/3774934.3786455openalex-snapshot
Fixing Non-blocking Data Structures for Better Compatibility with Memory Reclamation Schemes
inferred← citeshttps://doi.org/10.1145/3808310openalex-snapshot
Revisiting Partial Tracing for Safe, Efficient, and Concurrent Garbage Collection in Unmanaged Languages
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.35openalex-snapshot
VBR: Version Based Reclamation
inferred← citeshttps://doi.org/10.48550/arxiv.2012.14542openalex-snapshot
NBR: Neutralization Based Reclamation
inferred← citeshttps://doi.org/10.48550/arxiv.2108.02763openalex-snapshot
Crystalline: Fast and Memory Efficient Wait-Free Reclamation
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.