On the public citation graph
ThreadScan
0 signed · 46 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.1002/spe.600openalex-snapshot
The implementation of generic smart pointers for advanced defensive programming
inferredcites →https://doi.org/10.1007/11795490_3openalex-snapshot
A Lazy Concurrent List-Based Set Algorithm
inferredcites →https://doi.org/10.1007/978-3-642-33651-5_1openalex-snapshot
CBTree: A Practical Concurrent Self-Adjusting Search Tree
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.1017/s00446-002-0079-zopenalex-snapshot
Lock-free reference counting
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tpds.2004.8openalex-snapshot
Hazard pointers: safe memory reclamation for lock-free objects
inferredcites →https://doi.org/10.1109/tpds.2008.167openalex-snapshot
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
inferredcites →https://doi.org/10.1145/1011767.1011776openalex-snapshot
Lock-free linked lists and skip lists
inferredcites →https://doi.org/10.1145/1062247.1062249openalex-snapshot
Nonblocking memory management support for dynamic-sized data structures
inferredcites →https://doi.org/10.1145/1111596.1111597openalex-snapshot
An on-the-fly reference-counting garbage collector for java
inferredcites →https://doi.org/10.1145/1233307.1233309openalex-snapshot
Concurrent programming without locks
inferredcites →https://doi.org/10.1145/155090.155109openalex-snapshot
Space efficient conservative garbage collection
inferredcites →https://doi.org/10.1145/1618525.1618527openalex-snapshot
A lock-free, concurrent, and incremental stack scanning mechanism for garbage collectors
inferredcites →https://doi.org/10.1145/1854273.1854324openalex-snapshot
Using memory mapping to support cactus stacks in work-stealing runtime systems
inferredcites →https://doi.org/10.1145/1993806.1993821openalex-snapshot
On the power of hardware transactional memory to simplify memory management
inferredcites →https://doi.org/10.1145/2189750.2150998openalex-snapshot
Scalable address spaces using RCU balanced trees
inferredcites →https://doi.org/10.1145/224964.224988openalex-snapshot
Lock-free linked lists using compare-and-swap
inferredcites →https://doi.org/10.1145/2688500.2688501openalex-snapshot
More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms
inferredcites →https://doi.org/10.1145/2688500.2688523openalex-snapshot
The SprayList: a scalable relaxed priority queue
inferredcites →https://doi.org/10.1145/378795.378823openalex-snapshot
A parallel, real-time garbage collector
inferredcites →https://doi.org/10.1201/9781420035179openalex-snapshot
Handbook of Data Structures and Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/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.3591102openalex-snapshot
Applying Hazard Pointers to More Concurrent Data Structures
inferred← citeshttps://doi.org/10.1145/3583668.3594564openalex-snapshot
The ERA Theorem for Safe Memory Reclamation
inferred← citeshttps://doi.org/10.1145/3622827openalex-snapshot
Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1145/3626183.3659941openalex-snapshot
Expediting Hazard Pointers with Bounded RCU Critical Sections
inferred← citeshttps://doi.org/10.1145/3627535.3638491openalex-snapshot
Are Your Epochs Too Epic? Batch Free Can Be Harmful
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/3716312openalex-snapshot
Will It Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection
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
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.