On the public citation graph
A Lazy Concurrent List-Based Set Algorithm
0 signed · 166 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-36108-1_23openalex-snapshot
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
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/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1145/1122971.1122992openalex-snapshot
Proving correctness of highly-concurrent linearisable objects
inferredcites →https://doi.org/10.1145/224964.224988openalex-snapshot
Lock-free linked lists using compare-and-swap
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/571825.571829openalex-snapshot
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1201/9781420035179.ch47openalex-snapshot
Concurrent 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.1002/cpe.5024openalex-snapshot
A multi‐granularity locking scheme for java packedobjects based on a concurrent multiway tree
inferred← citeshttps://doi.org/10.1007/11817963_44openalex-snapshot
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-59854-9_18openalex-snapshot
Entropy Measurement of Concurrent Disorder
inferred← citeshttps://doi.org/10.1007/978-3-030-86359-3_29openalex-snapshot
Optimal Concurrency for List-Based Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_32openalex-snapshot
Make Flows Small Again: Revisiting the Flow Framework
inferred← citeshttps://doi.org/10.1007/978-3-031-64626-3_6openalex-snapshot
Intrathread Method Orders Based Adaptive Testing of Concurrent Objects
inferred← citeshttps://doi.org/10.1007/978-3-319-05810-8_21openalex-snapshot
APSkyline: Improved Skyline Computation for Multicore Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-10933-6_8openalex-snapshot
High Parallel Skyline Computation over Low-Cardinality Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_24openalex-snapshot
LCD: Local Combining on Demand
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_26openalex-snapshot
Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_29openalex-snapshot
On Developing Optimistic Transactional Lazy Set
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_1openalex-snapshot
Poling: SMT Aided Linearizability Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_10openalex-snapshot
In the Search for Optimal Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-58943-5_48openalex-snapshot
The Information Needed for Reproducing Shared Memory Experiments
inferred← citeshttps://doi.org/10.1007/978-3-319-64203-1_42openalex-snapshot
A Concurrency-Optimal Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-67952-5_11openalex-snapshot
A Concurrent Skip List Balanced on Search
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_16openalex-snapshot
Fragment Abstraction for Concurrent Shape Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_11openalex-snapshot
A Simple Optimistic Skiplist Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_15openalex-snapshot
Modular Safety Checking for Fine-Grained Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_21openalex-snapshot
Experience with Model Checking Linearizability
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_5openalex-snapshot
Abstract Transformers for Thread Correlation Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_41openalex-snapshot
Model Checking of Linearizability of Concurrent List Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_25openalex-snapshot
Verifying Linearisability with Potential Linearisation Points
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_20openalex-snapshot
Quantitative Synthesis for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-25821-3_1openalex-snapshot
Democratizing Transactional Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_22openalex-snapshot
On the Nature of Progress
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_21openalex-snapshot
How to Prove Algorithms Linearisable
inferred← citeshttps://doi.org/10.1007/978-3-642-31759-0_15openalex-snapshot
Parameterized Model Checking of Fine Grained Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_17openalex-snapshot
Practical Non-blocking Unordered Lists
inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_30openalex-snapshot
A Practical Transactional Memory Interface
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_12openalex-snapshot
Towards Automatic Lock Removal for Scalable Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_14openalex-snapshot
Why Non-blocking Operations Should be Selfish
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_24openalex-snapshot
A Constructive Approach for Proving Data Structures’ Linearizability
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_4openalex-snapshot
Automated Verification of Linearization Policies
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_24openalex-snapshot
Proving Linearizability Using Partial Orders
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_36openalex-snapshot
Abstract Specifications for Concurrent Maps
inferred← citeshttps://doi.org/10.1007/s00224-024-10184-wopenalex-snapshot
Lower Bounds on the Amortized Time Complexity of Shared Objects
inferred← citeshttps://doi.org/10.1007/s00446-024-00474-4openalex-snapshot
Fast and fair randomized wait-free locks
inferred← citeshttps://doi.org/10.1007/s10766-026-00828-4openalex-snapshot
NLock: A Scalable Lock for NUMA Architectures
inferred← citeshttps://doi.org/10.1007/s10817-010-9166-1openalex-snapshot
Automated Flaw Detection in Algebraic Specifications
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.043openalex-snapshot
A Concurrent Implementation of Skip Graphs
inferred← citeshttps://doi.org/10.1016/j.infsof.2018.07.001openalex-snapshot
Diversity driven adaptive test generation for concurrent data structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.01.002openalex-snapshot
Higher-order linearisability
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.03.001openalex-snapshot
Lock-free deques and doubly linked lists
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.11.005openalex-snapshot
Practical concurrent unrolled linked lists using lazy synchronization
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103362openalex-snapshot
Intrathread method orders based adaptive testing of concurrent objects
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/ase.2019.00074openalex-snapshot
Automating Non-Blocking Synchronization In Concurrent Data Abstractions
inferred← citeshttps://doi.org/10.1109/cgo.2013.6494981openalex-snapshot
Experiences in designing a robust and scalable interpreter profiling framework
inferred← citeshttps://doi.org/10.1109/icpads.2017.00058openalex-snapshot
Practical Concurrent Self-Organizing Lists
inferred← citeshttps://doi.org/10.1109/icpp.2016.48openalex-snapshot
Help-Optimal and Language-Portable Lock-Free Concurrent Data Structures
inferred← citeshttps://doi.org/10.1109/ipdps.2014.30openalex-snapshot
Remote Invalidation: Optimizing the Critical Path of Memory Transactions
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/ispdc62236.2024.10705400openalex-snapshot
Scalable Compact NUMA-aware Lock
inferred← citeshttps://doi.org/10.1109/issre.2016.31openalex-snapshot
Proving Concurrent Data Structures Linearizable
inferred← citeshttps://doi.org/10.1109/iti.2007.4283864openalex-snapshot
Lock-Free Stack and Queue: Java vs .NET
inferred← citeshttps://doi.org/10.1109/pact.2017.45openalex-snapshot
Redesigning Go’s Built-In Map to Support Concurrent Operations
inferred← citeshttps://doi.org/10.1109/pact58117.2023.00031openalex-snapshot
Separating Mechanism from Policy in STM
inferred← citeshttps://doi.org/10.1109/pdcat.2012.27openalex-snapshot
A Non-blocking Self-Organizing Linked List Algorithm
inferred← citeshttps://doi.org/10.1109/pdp66500.2025.00015openalex-snapshot
CNS Lock: Compact NUMA-aware Lock with a Standard Interface
inferred← citeshttps://doi.org/10.1109/sbac-pad53543.2021.00017openalex-snapshot
Synchronization Strategies on Many-Core SMT Systems
inferred← citeshttps://doi.org/10.1109/ssiri.2010.37openalex-snapshot
Model Checking a Lazy Concurrent List-Based Set Algorithm
inferred← citeshttps://doi.org/10.1109/tpds.2011.159openalex-snapshot
User-Level Implementations of Read-Copy Update
inferred← citeshttps://doi.org/10.1109/tpds.2017.2725837openalex-snapshot
Optimistic Transactional Boosting
inferred← citeshttps://doi.org/10.1109/tpds.2022.3151499openalex-snapshot
DHash: Dynamic Hash Tables With Non-Blocking Regular Operations
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/1122971.1122992openalex-snapshot
Proving correctness of highly-concurrent linearisable objects
inferred← citeshttps://doi.org/10.1145/1233307.1233309openalex-snapshot
Concurrent programming without locks
inferred← citeshttps://doi.org/10.1145/1375581.1375598openalex-snapshot
Deriving linearizable fine-grained concurrent objects
inferred← citeshttps://doi.org/10.1145/1375581.1375599openalex-snapshot
Sketching concurrent data structures
inferred← citeshttps://doi.org/10.1145/1379022.1375598openalex-snapshot
Deriving linearizable fine-grained concurrent objects
inferred← citeshttps://doi.org/10.1145/1379022.1375599openalex-snapshot
Sketching concurrent data structures
inferred← citeshttps://doi.org/10.1145/1835698.1835722openalex-snapshot
Verifying linearizability with hindsight
inferred← citeshttps://doi.org/10.1145/2254064.2254115openalex-snapshot
Dynamic synthesis for relaxed memory models
inferred← citeshttps://doi.org/10.1145/2345156.2254115openalex-snapshot
Dynamic synthesis for relaxed memory models
inferred← citeshttps://doi.org/10.1145/2491956.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
inferred← citeshttps://doi.org/10.1145/2499370.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
inferred← citeshttps://doi.org/10.1145/2500468.2500476openalex-snapshot
The balancing act of choosing nonblocking features
inferred← citeshttps://doi.org/10.1145/2508834.2513575openalex-snapshot
The Balancing Act of Choosing Nonblocking Features
inferred← citeshttps://doi.org/10.1145/2601381.2601393openalex-snapshot
Lock-free pending event set management in time warp
inferred← citeshttps://doi.org/10.1145/2629496openalex-snapshot
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures
inferred← citeshttps://doi.org/10.1145/2670418.2670439openalex-snapshot
WTTM 2013, the fifth workshop on the theory of transactional memory
inferred← citeshttps://doi.org/10.1145/2688500.2688518openalex-snapshot
Predicate RCU: an RCU for scalable concurrent updates
inferred← citeshttps://doi.org/10.1145/2755573.2755598openalex-snapshot
Transactional Acceleration of Concurrent Data Structures
inferred← citeshttps://doi.org/10.1145/2837614.2837635openalex-snapshot
A program logic for concurrent objects under fair scheduling
inferred← citeshttps://doi.org/10.1145/2851141.2851146openalex-snapshot
Optimistic concurrency with OPTIK
inferred← citeshttps://doi.org/10.1145/2851613.2851774openalex-snapshot
Checking linearizability with fine-grained traces
inferred← citeshttps://doi.org/10.1145/2858788.2688518openalex-snapshot
Predicate RCU: an RCU for scalable concurrent updates
inferred← citeshttps://doi.org/10.1145/2908080.2908112openalex-snapshot
Transactional data structure libraries
inferred← citeshttps://doi.org/10.1145/2914770.2837635openalex-snapshot
A program logic for concurrent objects under fair scheduling
inferred← citeshttps://doi.org/10.1145/2926697.2926699openalex-snapshot
Fast non-intrusive memory reclamation for highly-concurrent data structures
inferred← citeshttps://doi.org/10.1145/2928275.2928276openalex-snapshot
Supporting data-driven I/O on GPUs using GPUfs
inferred← citeshttps://doi.org/10.1145/2935764.2935774openalex-snapshot
Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free
inferred← citeshttps://doi.org/10.1145/2972206.2972213openalex-snapshot
Multi-tier Data Synchronization Based on an Optimized Concurrent Linked-list
inferred← citeshttps://doi.org/10.1145/2980983.2908112openalex-snapshot
Transactional data structure libraries
inferred← citeshttps://doi.org/10.1145/3016078.2851146openalex-snapshot
Optimistic concurrency with OPTIK
inferred← citeshttps://doi.org/10.1145/3064850openalex-snapshot
Verifying Invariants of Lock-Free Data Structures with Rely-Guarantee and Refinement Types
inferred← citeshttps://doi.org/10.1145/3087556.3087582openalex-snapshot
Concurrent Data Structures for Near-Memory Computing
inferred← citeshttps://doi.org/10.1145/3087801.3087838openalex-snapshot
Transactional Lock Elision Meets Combining
inferred← citeshttps://doi.org/10.1145/3178487.3178503openalex-snapshot
Practical concurrent traversals in search trees
inferred← citeshttps://doi.org/10.1145/3200691.3178503openalex-snapshot
Practical concurrent traversals in search trees
inferred← citeshttps://doi.org/10.1145/3241624.2926699openalex-snapshot
Fast non-intrusive memory reclamation for highly-concurrent data structures
inferred← citeshttps://doi.org/10.1145/3297858.3304047openalex-snapshot
Lazy Determinism for Faster Deterministic Multithreading
inferred← citeshttps://doi.org/10.1145/3323165.3323191openalex-snapshot
Concurrent Data Structures with Near-Data-Processing
inferred← citeshttps://doi.org/10.1145/3350755.3400213openalex-snapshot
Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures
inferred← citeshttps://doi.org/10.1145/3361525.3361537openalex-snapshot
Scalable Data-structures with Hierarchical, Distributed Delegation
inferred← citeshttps://doi.org/10.1145/3428196openalex-snapshot
Proving highly-concurrent traversals correct
inferred← citeshttps://doi.org/10.1145/3428224openalex-snapshot
The anchor verifier for blocking and non-blocking concurrent software
inferred← citeshttps://doi.org/10.1145/3503221.3508412openalex-snapshot
Bundling linked data structures for linearizable range queries
inferred← citeshttps://doi.org/10.1145/3519270.3538448openalex-snapshot
Fast and Fair Randomized Wait-Free Locks
inferred← citeshttps://doi.org/10.1145/3563337openalex-snapshot
A concurrent program logic with a future and history
inferred← citeshttps://doi.org/10.1145/3626183.3660272openalex-snapshot
Brief Announcement: A Fast Scalable Detectable Unrolled Lock-Based Linked List
inferred← citeshttps://doi.org/10.1145/3632924openalex-snapshot
A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability
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.3743339openalex-snapshot
CLEANN: Lock-Free Augmented Trees for Low-Dimensional κ-Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3694906.3743341openalex-snapshot
TLF: Transactional Lock Fusion
inferred← citeshttps://doi.org/10.11606/d.45.2008.tde-29092008-132758openalex-snapshot
Estruturas de dados concorrentes: um estudo de caso em skip graphs.
inferred← citeshttps://doi.org/10.1561/2500000011openalex-snapshot
Principles of Eventual Consistency
inferred← citeshttps://doi.org/10.17760/d20003058openalex-snapshot
Understanding and expressing scalable concurrency
inferred← citeshttps://doi.org/10.25560/47923openalex-snapshot
Reasoning with time and data abstractions
inferred← citeshttps://doi.org/10.26686/wgtn.16969549openalex-snapshot
The Design and Verification of Dynamic-sized Nonblocking Data Structures
inferred← citeshttps://doi.org/10.26686/wgtn.17004076openalex-snapshot
On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures
inferred← citeshttps://doi.org/10.34917/7646047openalex-snapshot
Concurrent Lazy Splay Tree with Relativistic Programming Approach
inferred← citeshttps://doi.org/10.4018/jdm.2015100102openalex-snapshot
Parallel Skyline Computation Exploiting the Lattice Structure
inferred← citeshttps://doi.org/10.4230/lipics.concur.2016.6openalex-snapshot
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
inferred← citeshttps://doi.org/10.4230/lipics.disc.2017.23openalex-snapshot
Consistency Models with Global Operation Sequencing and their Composition
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.45openalex-snapshot
Brief Announcement: Using Nesting to Push the Limits of Transactional Data Structure Libraries
inferred← citeshttps://doi.org/10.48456/tr-659openalex-snapshot
A safety proof of a lazy concurrent list-based set implementation
inferred← citeshttps://doi.org/10.48456/tr-726openalex-snapshot
Modular fine-grained concurrency verification
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0818openalex-snapshot
ActiveMonitor: Non-blocking Monitor Executions for Increased Parallelism
inferred← citeshttps://doi.org/10.48550/arxiv.1909.10879openalex-snapshot
A Taxonomic Review of Adaptive Random Testing: Current Status, Classifications, and Issues
inferred← citeshttps://doi.org/10.48550/arxiv.2012.14542openalex-snapshot
NBR: Neutralization Based Reclamation
inferred← citeshttps://doi.org/10.48550/arxiv.2110.05801openalex-snapshot
Verify Linearizability of Concurrent Stacks
inferred← citeshttps://doi.org/10.70675/35c0180dzc462z4178z90cez1700a6ba85c5openalex-snapshot
Synchronization costs in parallel programs and concurrent data structures
inferred← citeshttps://doi.org/10.7301/z0fn14n6openalex-snapshot
Theory and Applications of Parallelism with Futures
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.