On the public citation graph
Efficient lock-free durable sets
0 signed · 102 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/11795490_3openalex-snapshot
A Lazy Concurrent List-Based Set Algorithm
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-662-53426-7_23openalex-snapshot
Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1109/msst.2015.7208275openalex-snapshot
A study of application performance with non-volatile main memory
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/1807128.1807152openalex-snapshot
Benchmarking cloud serving systems with YCSB
inferredcites →https://doi.org/10.1145/2517349.2522714openalex-snapshot
Everything you always wanted to know about synchronization but were afraid to ask
inferredcites →https://doi.org/10.1145/2555243.2555256openalex-snapshot
Fast concurrent lock-free binary search trees
inferredcites →https://doi.org/10.1145/2723372.2749441openalex-snapshot
Let's Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems
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/2872362.2872381openalex-snapshot
High-Performance Transactions for Persistent Memories
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/2954679.2872381openalex-snapshot
High-Performance Transactions for Persistent Memories
inferredcites →https://doi.org/10.1145/2983990.2983995openalex-snapshot
Chain: tasks and channels for reliable intermittent programs
inferredcites →https://doi.org/10.1145/3133891openalex-snapshot
Efficient logging in non-volatile memory by exploiting coherency protocols
inferredcites →https://doi.org/10.1145/3133920openalex-snapshot
Alpaca: intermittent execution without checkpoints
inferredcites →https://doi.org/10.1145/3178487.3178490openalex-snapshot
A persistent lock-free queue for non-volatile memory
inferredcites →https://doi.org/10.1145/3210377.3210400openalex-snapshot
The Inherent Cost of Remembering Consistently
inferredcites →https://doi.org/10.1145/3276513openalex-snapshot
Every data structure deserves lock-free memory reclamation
inferredcites →https://doi.org/10.1145/3297858.3304046openalex-snapshot
Fine-Grain Checkpointing with In-Cache-Line Logging
inferredcites →https://doi.org/10.1145/3314221.3314583openalex-snapshot
Transactional concurrency control for intermittent, energy-harvesting computing systems
inferredcites →https://doi.org/10.1145/3323165.3323187openalex-snapshot
Delay-Free Concurrency on Faulty Persistent Memory
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.14778/2732951.2732960openalex-snapshot
Scalable logging through emerging non-volatile memory
inferredcites →https://doi.org/10.14778/3025111.3025122openalex-snapshot
Persistent hybrid transactional memory for databases
inferredcites →https://doi.org/10.4230/lipics.disc.2017.37openalex-snapshot
Dalí: A Periodically Persistent Hash Map
inferredcites →https://doi.org/10.4230/lipics.snapl.2017.8openalex-snapshot
Intermittent Computing: Challenges and Opportunities
inferredcites →https://doi.org/10.5555/3291168.3291178openalex-snapshot
Adaptive dynamic checkpointing for safe efficient intermittent computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-50086-3_3openalex-snapshot
Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_13openalex-snapshot
Checking Opacity and Durable Opacity with FDR
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_10openalex-snapshot
Abstraction for Crash-Resilient Objects
inferred← citeshttps://doi.org/10.1007/978-3-031-25803-9_6openalex-snapshot
SMT-Based Verification of Persistency Invariants of Px86 Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_3openalex-snapshot
The Fence Complexity of Persistent Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_8openalex-snapshot
Specifying and Verifying Persistent Libraries
inferred← citeshttps://doi.org/10.1007/s00778-023-00812-1openalex-snapshot
A quantitative evaluation of persistent memory hash indexes
inferred← citeshttps://doi.org/10.1016/j.future.2024.02.008openalex-snapshot
A highly write-optimized concurrent B + -tree for persistent memory
inferred← citeshttps://doi.org/10.1109/hpca56546.2023.10071088openalex-snapshot
Reconciling Selective Logging and Hardware Persistent Memory Transaction
inferred← citeshttps://doi.org/10.1109/iccd58817.2023.00035openalex-snapshot
Accelerating Persistent Hash Indexes via Reducing Negative Searches
inferred← citeshttps://doi.org/10.1109/iccd65941.2025.00034openalex-snapshot
ALPHA: A Scalable Lock-Free Partitioned Hash Index for Persistent Memory on NUMA Architectures
inferred← citeshttps://doi.org/10.1109/iccq51190.2021.9392904openalex-snapshot
An Efficient Dynamic Analysis Tool for Checking Durable Linearizability
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00109openalex-snapshot
EEPH: An Efficient Extendible Perfect Hashing for Hybrid PMem-DRAM
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00299openalex-snapshot
Improving the Relationship Between B+-Tree and Memory Allocator for Persistent Memory
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00249openalex-snapshot
Hybrid DRAM-NVM R-Trees with Consistency Guarantee
inferred← citeshttps://doi.org/10.1109/tkde.2024.3421232openalex-snapshot
ZBTree: A Fast and Scalable B+-Tree for Persistent Memory
inferred← citeshttps://doi.org/10.1145/3371079openalex-snapshot
Persistency semantics of the Intel-x86 architecture
inferred← citeshttps://doi.org/10.1145/3428219openalex-snapshot
Persistent Owicki-Gries reasoning: a program logic for reasoning about persistent programs on Intel-x86
inferred← citeshttps://doi.org/10.1145/3445814.3446744openalex-snapshot
Fast, flexible, and comprehensive bug detection for persistent memory programs
inferred← citeshttps://doi.org/10.1145/3453483.3454027openalex-snapshot
Revamping hardware persistency models: view-based and axiomatic persistency models for Intel-x86 and Armv8
inferred← citeshttps://doi.org/10.1145/3453483.3454105openalex-snapshot
Mirror: making lock-free data structures persistent
inferred← citeshttps://doi.org/10.1145/3472456.3472458openalex-snapshot
A Fast, General System for Buffered Persistent Data Structures
inferred← citeshttps://doi.org/10.1145/3503221.3508444openalex-snapshot
Detectable recovery of lock-free data structures
inferred← citeshttps://doi.org/10.1145/3511211openalex-snapshot
Unified Holistic Memory Management Supporting Multiple Big Data Processing Frameworks over Hybrid Memories
inferred← citeshttps://doi.org/10.1145/3514221.3517884openalex-snapshot
Halo: A Hybrid PMem-DRAM Persistent Hash Index with Fast Recovery
inferred← citeshttps://doi.org/10.1145/3558481.3591079openalex-snapshot
Transactional Composition of Nonblocking Data Structures
inferred← citeshttps://doi.org/10.1145/3579370.3594766openalex-snapshot
TurboHash: A Hash Table for Key-value Store on Persistent Memory
inferred← citeshttps://doi.org/10.1145/3591232openalex-snapshot
Memento: A Framework for Detectable Recoverability in Persistent Memory
inferred← citeshttps://doi.org/10.1145/3609308.3625270openalex-snapshot
PLayer: Expanding Coherence Protocol Stack with a Persistence Layer
inferred← citeshttps://doi.org/10.1145/3620665.3640407openalex-snapshot
Skip It: Take Control of Your Cache!
inferred← citeshttps://doi.org/10.1145/3663338openalex-snapshot
Proceedings of the 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems
inferred← citeshttps://doi.org/10.1145/3694906.3743314openalex-snapshot
Persistent HyTM via Fast Path Fine-Grained Locking
inferred← citeshttps://doi.org/10.1145/3694906.3743321openalex-snapshot
Reconciling Hardware Transactional Memory and Persistent Programming with Buffered Durability
inferred← citeshttps://doi.org/10.1145/3712285.3759776openalex-snapshot
MetoHash: A Memory-Efficient and Traffic-Optimized Hashing Index on Hybrid PMem-DRAM Memories
inferred← citeshttps://doi.org/10.1145/3816782.3819217openalex-snapshot
KDB: A Scalable Persistent Key-Value Store with Atomic Batches and Snapshots
inferred← citeshttps://doi.org/10.14778/3436905.3436921openalex-snapshot
Understanding the idiosyncrasies of real persistent memory
inferred← citeshttps://doi.org/10.14778/3446095.3446101openalex-snapshot
Persistent memory hash indexes
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.52openalex-snapshot
Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:7)2022openalex-snapshot
Modularising Verification Of Durable Opacity
inferred← citeshttps://doi.org/10.48550/arxiv.2010.13593openalex-snapshot
Taming x86-TSO Persistency (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2108.04202openalex-snapshot
FliT: A Library for Simple and Efficient Persistent Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2111.03881openalex-snapshot
Abstraction for Crash-Resilient Objects (Extended Version)
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.