On the public citation graph
Lock-Free Transactional Transformation for Linked Data Structures
0 signed · 55 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-03850-6_15openalex-snapshot
A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention
inferredcites →https://doi.org/10.1007/978-3-319-14472-6_29openalex-snapshot
On Developing Optimistic Transactional Lazy Set
inferredcites →https://doi.org/10.1007/978-3-642-31057-7_15openalex-snapshot
Lock Inference in the Presence of Large Libraries
inferredcites →https://doi.org/10.1109/tpds.2015.2419651openalex-snapshot
A Lock-Free Priority Queue Design Based on Multi-Dimensional Linked Lists
inferredcites →https://doi.org/10.1145/1066650.1066660openalex-snapshot
Design tradeoffs in modern software transactional memory systems
inferredcites →https://doi.org/10.1145/1229428.1229442openalex-snapshot
Open nesting in software transactional memory
inferredcites →https://doi.org/10.1145/1345206.1345233openalex-snapshot
On the correctness of transactional memory
inferredcites →https://doi.org/10.1145/1378533.1378587openalex-snapshot
On obstruction-free transactions
inferredcites →https://doi.org/10.1145/1379022.1375619openalex-snapshot
Inferring locks for atomic sections
inferredcites →https://doi.org/10.1145/1400214.1400228openalex-snapshot
Software transactional memory
inferredcites →https://doi.org/10.1145/1454456.1454466openalex-snapshot
Software Transactional Memory: Why Is It Only a Research Toy?
inferredcites →https://doi.org/10.1145/1508244.1508263openalex-snapshot
Early experience with a commercial hardware transactional memory implementation
inferredcites →https://doi.org/10.1145/1693453.1693462openalex-snapshot
Is transactional programming actually easier?
inferredcites →https://doi.org/10.1145/1835698.1835699openalex-snapshot
The inherent complexity of transactional memory and what to do about it
inferredcites →https://doi.org/10.1145/1835698.1835736openalex-snapshot
Non-blocking binary search trees
inferredcites →https://doi.org/10.1145/2048066.2048073openalex-snapshot
Testing atomicity of composed concurrent operations
inferredcites →https://doi.org/10.1145/2076021.2048073openalex-snapshot
Testing atomicity of composed concurrent operations
inferredcites →https://doi.org/10.1145/2499370.2462172openalex-snapshot
Concurrent libraries with foresight
inferredcites →https://doi.org/10.1145/2688500.2688510openalex-snapshot
Low-overhead software transactional memory with progress guarantees and strong semantics
inferredcites →https://doi.org/10.1145/2688500.2688511openalex-snapshot
Automatic scalable atomicity via semantic locking
inferredcites →https://doi.org/10.1145/2908080.2908112openalex-snapshot
Transactional data structure libraries
inferredcites →https://doi.org/10.1145/301308.301339openalex-snapshot
Scalable concurrent priority queue algorithms
inferredcites →https://doi.org/10.1145/322154.322158openalex-snapshot
The serializability of concurrent database updates
inferredcites →https://doi.org/10.1145/564870.564881openalex-snapshot
High performance dynamic lock-free hash tables and list-based sets
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/872035.872048openalex-snapshot
Software transactional memory for dynamic-sized data structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/escience65000.2025.00035openalex-snapshot
Locks Must Die: Composable Mutual Exclusion Implemented by Dynamic Resource Sharing on Task Graphs
inferred← citeshttps://doi.org/10.1109/icbc59979.2024.10634415openalex-snapshot
Lock-Free Concurrent Smart Contracts
inferred← citeshttps://doi.org/10.1145/3332466.3374514openalex-snapshot
Nesting and composition in transactional data structure libraries
inferred← citeshttps://doi.org/10.1145/3380536.3380543openalex-snapshot
Lock-free transactional vector
inferred← citeshttps://doi.org/10.1145/3409964.3461826openalex-snapshot
Semantic Conflict Detection for Transactional Data Structure Libraries
inferred← citeshttps://doi.org/10.1145/3694906.3743341openalex-snapshot
TLF: Transactional Lock Fusion
inferred← citeshttps://doi.org/10.1145/3700148openalex-snapshot
Blockchain Scalability with Proof of Descriptor
inferred← citeshttps://doi.org/10.1145/3710848.3710876openalex-snapshot
Transactional Data Structures with Orthogonal Metadata
inferred← citeshttps://doi.org/10.13140/rg.2.2.26693.58089openalex-snapshot
Practical Dynamic Transactional Data Structures
inferred← citeshttps://doi.org/10.14293/s2199-1006.1.sor-.ppho1jo.v1openalex-snapshot
Reimplementation and Performance Evaluation of a Lock-free Queue with Batching
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.45openalex-snapshot
Brief Announcement: Using Nesting to Push the Limits of Transactional Data Structure Libraries
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.