On the public citation graph

High performance dynamic lock-free hash tables and list-based sets

0 signed · 377 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.

Claim with ORCID

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.

See reference health

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/s004460050028openalex-snapshot

Software transactional memory

inferredcites →https://doi.org/10.1093/comjnl/17.4.324openalex-snapshot

The Art of Computer Programming, Volume 3, Sorting and Searching

inferredcites →https://doi.org/10.1109/12.280802openalex-snapshot

A nonblocking algorithm for shared queues using compare-and-swap

inferredcites →https://doi.org/10.1109/71.819952openalex-snapshot

Universal constructions for large objects

inferredcites →https://doi.org/10.1145/109625.109637openalex-snapshot

Scalable reader-writer synchronization for shared-memory multiprocessors

inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot

Wait-free synchronization

inferredcites →https://doi.org/10.1145/137097.137873openalex-snapshot

Locking without blocking

inferredcites →https://doi.org/10.1145/142111.993246openalex-snapshot

A Lock-Free Multiprocessor OS Kernel

inferredcites →https://doi.org/10.1145/161468.161469openalex-snapshot

A methodology for implementing highly concurrent data objects

inferredcites →https://doi.org/10.1145/165231.165265openalex-snapshot

A method for implementing lock-free shared-data structures

inferredcites →https://doi.org/10.1145/197917.198079openalex-snapshot

Disjoint-access-parallel implementations of strong shared memory primitives

inferredcites →https://doi.org/10.1145/224964.224988openalex-snapshot

Lock-free linked lists using compare-and-swap

inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot

Simple, fast, and practical non-blocking and blocking concurrent queue algorithms

inferredcites →https://doi.org/10.1145/259380.259442openalex-snapshot

Practical implementations of non-blocking synchronization primitives

inferredcites →https://doi.org/10.1145/308386.308442openalex-snapshot

Concurrent set manipulation without locking

inferredcites →https://doi.org/10.1145/383962.384016openalex-snapshot

Lock-free reference counting

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/773453.808203openalex-snapshot

Dynamic decentralized cache schemes for mimd parallel processors

inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot

Linearizability: a correctness condition for concurrent objects

inferredcites →https://doi.org/10.1145/800015.808203openalex-snapshot

Dynamic decentralized cache schemes for mimd parallel processors

inferredcites →https://doi.org/10.2307/2583667openalex-snapshot

Introduction to Algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4612699openalex-extracted

LeCache:TowardsAdaptiveCacheMemoryAllocationviaAdmissionControl

inferred← citeshttps://doi.org/10.1002/9781119332015.ch3openalex-snapshot

Lock‐Free Concurrent Data Structures

inferred← citeshttps://doi.org/10.1002/cpe.3876openalex-snapshot

A skip list for multicore

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.1002/cpe.5732openalex-snapshot

Dynamic Transactional Transformation

inferred← citeshttps://doi.org/10.1002/cpe.7935openalex-snapshot

Compiler‐driven approach for automating nonblocking synchronization in concurrent data abstractions

inferred← citeshttps://doi.org/10.1007/11561071_31openalex-snapshot

Allocating Memory in a Lock-Free Manner

inferred← citeshttps://doi.org/10.1007/11561927_10openalex-snapshot

Non-blocking Hashtables with Open Addressing

inferred← citeshttps://doi.org/10.1007/11602569_6openalex-snapshot

Preemption Adaptivity in Time-Published Queue-Based Spin Locks

inferred← citeshttps://doi.org/10.1007/11795490_3openalex-snapshot

A Lazy Concurrent List-Based Set Algorithm

inferred← citeshttps://doi.org/10.1007/11864219_3openalex-snapshot

Built-In Coloring for Highly-Concurrent Doubly-Linked Lists

inferred← citeshttps://doi.org/10.1007/11945529_11openalex-snapshot

Lock-Free Dynamically Resizable Arrays

inferred← citeshttps://doi.org/10.1007/978-1-4419-9736-4openalex-snapshot

Formal Development of a Network-Centric RTOS: Software Engineering for Reliable Embedded Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_8openalex-snapshot

On Helping and Stacks

inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_22openalex-snapshot

A Pragmatic Non-blocking Concurrent Directed Acyclic Graph

inferred← citeshttps://doi.org/10.1007/978-3-030-35225-7_14openalex-snapshot

Lock-Free Transactional Adjacency List

inferred← citeshttps://doi.org/10.1007/978-3-030-50743-5_1openalex-snapshot

FASTHash: FPGA-Based High Throughput Parallel Hash Table

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-01740-7openalex-snapshot

Shared-Memory Synchronization

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-45155-3_5openalex-snapshot

Enhancing Privacy Protection in Intelligent Surveillance: Video Blockchain Solutions

inferred← citeshttps://doi.org/10.1007/978-3-031-67321-4_2openalex-snapshot

Concurrent Wait-Free Graph Snapshots Using Multi-versioning

inferred← citeshttps://doi.org/10.1007/978-3-319-04132-2_12openalex-snapshot

On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs

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-24024-4_15openalex-snapshot

Data-Streaming and Concurrent Data-Object Co-design: Overview and Algorithmic Challenges

inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_20openalex-snapshot

Of Concurrent Data Structures and Iterations

inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_30openalex-snapshot

A Thrifty Universal Construction

inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_40openalex-snapshot

Multicore vs Manycore: The Energy Cost of Concurrency

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-89884-1_16openalex-snapshot

Fragment Abstraction for Concurrent Shape Analysis

inferred← citeshttps://doi.org/10.1007/978-3-319-96983-1_41openalex-snapshot

Efficient Lock-Free Removing and Compaction for the Cache-Trie Data Structure

inferred← citeshttps://doi.org/10.1007/978-3-319-98047-8_18openalex-snapshot

Reasoning About Weak Semantics via Strong Semantics

inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_4openalex-snapshot

On the Uncontended Complexity of Consensus

inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_92openalex-snapshot

CAS-Based Lock-Free Algorithm for Shared Deques

inferred← citeshttps://doi.org/10.1007/978-3-540-68624-8_5openalex-snapshot

Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives

inferred← citeshttps://doi.org/10.1007/978-3-540-85261-2_11openalex-snapshot

Associative Parallel Containers in STAPL

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-04355-0_12openalex-snapshot

Elastic Transactions

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-12098-5_19openalex-snapshot

Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval

inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_21openalex-snapshot

Temporal Logic Verification of Lock-Freedom

inferred← citeshttps://doi.org/10.1007/978-3-642-13374-9_2openalex-snapshot

The STAPL pList

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-17679-1_10openalex-snapshot

Locality-Conscious Lock-Free Linked Lists

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-31759-0_15openalex-snapshot

Parameterized Model Checking of Fine Grained Concurrency

inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_39openalex-snapshot

Brief Announcement: A Contention-Friendly, Non-blocking Skip List

inferred← citeshttps://doi.org/10.1007/978-3-642-35893-7_6openalex-snapshot

Recalibrating Fine-Grained Locking in Parallel Bucket Hash Tables

inferred← citeshttps://doi.org/10.1007/978-3-642-36036-7_11openalex-snapshot

Lock-Free Resizeable Concurrent Tries

inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_25openalex-snapshot

A Contention-Friendly Binary Search Tree

inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_10openalex-snapshot

Generic Multiversion STM

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-48653-5_14openalex-snapshot

Why Non-blocking Operations Should be Selfish

inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_22openalex-snapshot

Transactional Interference-Less Balanced Tree

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-981-96-0894-2_6openalex-snapshot

Concurrent Encrypted Multimaps

inferred← citeshttps://doi.org/10.1007/s00224-008-9155-5openalex-snapshot

Nonblocking k-Compare-Single-Swap

inferred← citeshttps://doi.org/10.1007/s00224-012-9420-5openalex-snapshot

Built-in Coloring for Highly-Concurrent Doubly-Linked Lists

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-004-0115-2openalex-snapshot

Lock-free dynamic hash tables with open addressing

inferred← citeshttps://doi.org/10.1007/s00446-022-00441-xopenalex-snapshot

The splay-list: a distribution-adaptive concurrent skip-list

inferred← citeshttps://doi.org/10.1007/s00453-008-9268-xopenalex-snapshot

NBmalloc: Allocating Memory in a Lock-Free Manner

inferred← citeshttps://doi.org/10.1007/s00607-022-01085-2openalex-snapshot

On the correctness of a lock-free compression-based elastic mechanism for a hash trie design

inferred← citeshttps://doi.org/10.1007/s10055-018-0332-9openalex-snapshot

Flexible data structures for dynamic virtual auditory scenes

inferred← citeshttps://doi.org/10.1007/s10515-017-0219-0openalex-snapshot

Self-adaptive concurrent components

inferred← citeshttps://doi.org/10.1007/s10766-015-0376-3openalex-snapshot

A Wait-Free Hash Map

inferred← citeshttps://doi.org/10.1007/s11227-014-1239-1openalex-snapshot

Exploiting fine-grained parallelism in graph traversal algorithms via lock virtualization on multi-core architecture

inferred← citeshttps://doi.org/10.1007/s11227-022-04457-9openalex-snapshot

Efficient parallel graph trimming by arc-consistency

inferred← citeshttps://doi.org/10.1007/s13222-019-00329-4openalex-snapshot

Lock-free Data Structures for Data Stream Processing

inferred← citeshttps://doi.org/10.1016/j.cag.2016.03.002openalex-snapshot

GPU accelerated grid-free surface tracking

inferred← citeshttps://doi.org/10.1016/j.future.2017.12.054openalex-snapshot

Concurrent hash tables on multicore machines: Comparison, evaluation and implications

inferred← citeshttps://doi.org/10.1016/j.ic.2006.10.003openalex-snapshot

A general lock-free algorithm using compare-and-swap

inferred← citeshttps://doi.org/10.1016/j.ins.2018.06.023openalex-snapshot

An optimized unsupervised manifold learning algorithm for manycore architectures

inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.01.004openalex-snapshot

Lock-free parallel dynamic programming

inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.12.010openalex-snapshot

Parallel implementations of Brunotte’s algorithm

inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.10.010openalex-snapshot

Elastic transactions

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.jpdc.2021.01.001openalex-snapshot

On the correctness and efficiency of a novel lock-free hash trie map design

inferred← citeshttps://doi.org/10.1016/j.scico.2006.10.001openalex-snapshot

Lock-free parallel and concurrent garbage collection by mark&sweep

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.041openalex-snapshot

Concurrent linearizable nearest neighbour search in LockFree-kD-tree

inferred← citeshttps://doi.org/10.1093/bioinformatics/btr011openalex-snapshot

A fast, lock-free approach for efficient parallel counting of occurrences of k -mers

inferred← citeshttps://doi.org/10.1109/access.2013.2282500openalex-snapshot

LC/DC: Lockless Containers and Data Concurrency a Novel Nonblocking Container Library for Multicore Applications

inferred← citeshttps://doi.org/10.1109/access.2022.3170916openalex-snapshot

Pivotal B+tree for Byte-Addressable Persistent Memory

inferred← citeshttps://doi.org/10.1109/acsd.2009.10openalex-snapshot

Formal Verification of Lock-Free Algorithms

inferred← citeshttps://doi.org/10.1109/cciot.2014.7062511openalex-snapshot

Performance analysis of parallel smoothed particle hydrodynamics on multi-core CPUs

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/cgo.2013.6494991openalex-snapshot

Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms

inferred← citeshttps://doi.org/10.1109/chinacom.2012.6417441openalex-snapshot

Parallelizing sequential network applications with customized lock-free data structures

inferred← citeshttps://doi.org/10.1109/cis.2016.0103openalex-snapshot

Parallel Acceleration of IBM Alignment Model based on Lock-Free Hash Table

inferred← citeshttps://doi.org/10.1109/cloudcom.2010.9openalex-snapshot

A Novel Parallel Traffic Control Mechanism for Cloud Computing

inferred← citeshttps://doi.org/10.1109/cluster.2011.34openalex-snapshot

Performance Characterization and Optimization of Atomic Operations on AMD GPUs

inferred← citeshttps://doi.org/10.1109/dsn.2019.00028openalex-snapshot

OneFile: A Wait-Free Persistent Transactional Memory

inferred← citeshttps://doi.org/10.1109/eurosp63326.2025.00042openalex-snapshot

Sequentially Consistent Concurrent Encrypted Multimaps

inferred← citeshttps://doi.org/10.1109/hipc.2017.00027openalex-snapshot

Expander: Lock-Free Cache for a Concurrent Data Structure

inferred← citeshttps://doi.org/10.1109/hpca.2017.54openalex-snapshot

GraphPIM: Enabling Instruction-Level PIM Offloading in Graph Computing Frameworks

inferred← citeshttps://doi.org/10.1109/hpec.2014.7040975openalex-snapshot

Lockless hash tables with low false negatives

inferred← citeshttps://doi.org/10.1109/icacia.2009.5361143openalex-snapshot

A lock-free algorithm for union-find with deletion

inferred← citeshttps://doi.org/10.1109/icdcs.2013.42openalex-snapshot

No Hot Spot Non-blocking Skip List

inferred← citeshttps://doi.org/10.1109/icdcs.2014.70openalex-snapshot

Lock-Free Cuckoo Hashing

inferred← citeshttps://doi.org/10.1109/icdcs.2016.19openalex-snapshot

An Efficient Lock-Free Logarithmic Search Data Structure Based on Multi-dimensional List

inferred← citeshttps://doi.org/10.1109/icdcs.2019.00157openalex-snapshot

Concurrent Unrolled Skiplist

inferred← citeshttps://doi.org/10.1109/icde.2009.121openalex-snapshot

Oracle Streams: A High Performance Implementation for Near Real Time Asynchronous Replication

inferred← citeshttps://doi.org/10.1109/icpp.2005.34openalex-snapshot

Distributed Queue-Based Locking Using Advanced Network Features

inferred← citeshttps://doi.org/10.1109/icpp.2010.68openalex-snapshot

Lock-Free Multiway Search Trees

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.2013.91openalex-snapshot

A Study of the Behavior of Synchronization Methods in Commonly Used Languages and Systems

inferred← citeshttps://doi.org/10.1109/ipdps.2018.00052openalex-snapshot

A Dynamic Hash Table for the GPU

inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00091openalex-snapshot

Dynamic NUMA-Aware Data Structure Replication

inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00015openalex-snapshot

Optimizing Parallel Reduction on OpenCL FPGA Platform – A Case Study of Frequent Pattern Compression

inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00092openalex-snapshot

Optimizing an Atomics-Based Reduction Kernel on OpenCL FPGA Platform

inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341274openalex-snapshot

Pac-Man is Overkill

inferred← citeshttps://doi.org/10.1109/ispa.2012.87openalex-snapshot

Cache Performance and Efficiency Factors of Parallel Data Structures

inferred← citeshttps://doi.org/10.1109/ispdc52870.2021.9521630openalex-snapshot

Towards an Elastic Lock-Free Hash Trie Design

inferred← citeshttps://doi.org/10.1109/isqed60706.2024.10528703openalex-snapshot

sLLM: Accelerating LLM Inference using Semantic Load Balancing with Shared Memory Data Structures

inferred← citeshttps://doi.org/10.1109/isssr.2016.023openalex-snapshot

Experimental Validation and Exploration of a New Kind of Synchronization in Linux

inferred← citeshttps://doi.org/10.1109/iti.2007.4283864openalex-snapshot

Lock-Free Stack and Queue: Java vs .NET

inferred← citeshttps://doi.org/10.1109/ldav.2013.6675157openalex-snapshot

An analysis of scalable GPU-based ray-guided volume rendering

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/pdcat.2012.27openalex-snapshot

A Non-blocking Self-Organizing Linked List Algorithm

inferred← citeshttps://doi.org/10.1109/pdp.2011.48openalex-snapshot

Efficient parallel execution of streaming applications on multi-core processors

inferred← citeshttps://doi.org/10.1109/pdp52278.2021.00012openalex-snapshot

Nonblocking Data Structures for Distributed-Memory Machines: Stacks as an Example

inferred← citeshttps://doi.org/10.1109/samos.2013.6621118openalex-snapshot

Concurrent multi-level arrays: Wait-free extensible hash maps

inferred← citeshttps://doi.org/10.1109/samos.2015.7363668openalex-snapshot

Tervel: A unification of descriptor-based techniques for non-blocking programming

inferred← citeshttps://doi.org/10.1109/sbac-pad.2017.26openalex-snapshot

Towards a Lock-Free, Fixed Size and Persistent Hash Map Design

inferred← citeshttps://doi.org/10.1109/sbac-pad53543.2021.00012openalex-snapshot

DACHash: A Dynamic, Cache-Aware and Concurrent Hash Table on GPUs

inferred← citeshttps://doi.org/10.1109/sc.2018.00013openalex-snapshot

Extreme Scale De Novo Metagenome Assembly

inferred← citeshttps://doi.org/10.1109/tc.2012.248openalex-snapshot

Supporting Lock-Free Composition of Concurrent Data Objects: Moving Data between Containers

inferred← citeshttps://doi.org/10.1109/tc.2020.3015727openalex-snapshot

A Fast Lock for Explicit Message Passing Architectures

inferred← citeshttps://doi.org/10.1109/tpds.2004.8openalex-snapshot

Hazard pointers: safe memory reclamation for lock-free objects

inferred← citeshttps://doi.org/10.1109/tpds.2016.2594763openalex-snapshot

A Collision-Mitigation Cuckoo Hashing Scheme for Large-Scale Storage Systems

inferred← citeshttps://doi.org/10.1109/tpds.2019.2929768openalex-snapshot

Data-Parallel Hashing Techniques for GPU Architectures

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.2024.3372621openalex-snapshot

Revisiting PM-Based B-Tree With Persistent CPU Cache

inferred← citeshttps://doi.org/10.1109/trustcom.2016.0212openalex-snapshot

A Skew-Insensitive Hashing Sync and Construction Scheme for Many-Core Coprocessors

inferred← citeshttps://doi.org/10.1137/1.9781611976021.4openalex-snapshot

Lock-Free Hopscotch Hashing

inferred← citeshttps://doi.org/10.1142/s0129626416500158openalex-snapshot

A Fast Contention-Friendly Binary Search Tree

inferred← citeshttps://doi.org/10.1145/1011767.1011776openalex-snapshot

Lock-free linked lists and skip lists

inferred← citeshttps://doi.org/10.1145/1011767.1011829openalex-snapshot

Brief announcement

inferred← citeshttps://doi.org/10.1145/1062247.1062249openalex-snapshot

Nonblocking memory management support for dynamic-sized data structures

inferred← citeshttps://doi.org/10.1145/1111037.1111068openalex-snapshot

Autolocker

inferred← citeshttps://doi.org/10.1145/1122971.1122992openalex-snapshot

Proving correctness of highly-concurrent linearisable objects

inferred← citeshttps://doi.org/10.1145/1128022.1128030openalex-snapshot

Landing openMP on cyclops-64

inferred← citeshttps://doi.org/10.1145/1147954.1147958openalex-snapshot

Split-ordered lists

inferred← citeshttps://doi.org/10.1145/1233307.1233309openalex-snapshot

Concurrent programming without locks

inferred← citeshttps://doi.org/10.1145/1250662.1250668openalex-snapshot

Synchronization state buffer

inferred← citeshttps://doi.org/10.1145/1273440.1250668openalex-snapshot

Synchronization state buffer

inferred← citeshttps://doi.org/10.1145/1345206.1345237openalex-snapshot

Transactional boosting

inferred← citeshttps://doi.org/10.1145/1375581.1375598openalex-snapshot

Deriving linearizable fine-grained concurrent objects

inferred← citeshttps://doi.org/10.1145/1379022.1375598openalex-snapshot

Deriving linearizable fine-grained concurrent objects

inferred← citeshttps://doi.org/10.1145/1457150.1457152openalex-snapshot

CAM conscious integrated answering of frequent elements and top-k queries over data streams

inferred← citeshttps://doi.org/10.1145/1457150.1457157openalex-snapshot

Critical sections

inferred← citeshttps://doi.org/10.1145/1480881.1480886openalex-snapshot

Proving that non-blocking algorithms don't block

inferred← citeshttps://doi.org/10.1145/1508244.1508263openalex-snapshot

Early experience with a commercial hardware transactional memory implementation

inferred← citeshttps://doi.org/10.1145/1556444.1556455openalex-snapshot

NOBLE

inferred← citeshttps://doi.org/10.1145/1594834.1480886openalex-snapshot

Proving that non-blocking algorithms don't block

inferred← citeshttps://doi.org/10.1145/1693453.1693503openalex-snapshot

Supporting lock-free composition of concurrent data objects

inferred← citeshttps://doi.org/10.1145/1787275.1787286openalex-snapshot

Supporting lock-free composition of concurrent data objects

inferred← citeshttps://doi.org/10.1145/1815695.1815713openalex-snapshot

STAPL

inferred← citeshttps://doi.org/10.1145/1835698.1835736openalex-snapshot

Non-blocking binary search trees

inferred← citeshttps://doi.org/10.1145/1941553.1941586openalex-snapshot

The STAPL parallel container framework

inferred← citeshttps://doi.org/10.1145/1989493.1989544openalex-snapshot

Brief announcement

inferred← citeshttps://doi.org/10.1145/1993316.1993541openalex-snapshot

Cruiser

inferred← citeshttps://doi.org/10.1145/1993498.1993541openalex-snapshot

Cruiser

inferred← citeshttps://doi.org/10.1145/2038037.1941586openalex-snapshot

The STAPL parallel container framework

inferred← citeshttps://doi.org/10.1145/2063384.2063439openalex-snapshot

Scalable hashing for shared memory supercomputers

inferred← citeshttps://doi.org/10.1145/2145816.2145836openalex-snapshot

Concurrent tries with efficient non-blocking snapshots

inferred← citeshttps://doi.org/10.1145/2145816.2145868openalex-snapshot

LHlf

inferred← citeshttps://doi.org/10.1145/2145816.2145869openalex-snapshot

Wait-free linked-lists

inferred← citeshttps://doi.org/10.1145/2312005.2312036openalex-snapshot

A non-blocking internal binary search tree

inferred← citeshttps://doi.org/10.1145/2370036.2145836openalex-snapshot

Concurrent tries with efficient non-blocking snapshots

inferred← citeshttps://doi.org/10.1145/2370036.2145868openalex-snapshot

LHlf

inferred← citeshttps://doi.org/10.1145/2370036.2145869openalex-snapshot

Wait-free linked-lists

inferred← citeshttps://doi.org/10.1145/2463676.2463710openalex-snapshot

Hekaton

inferred← citeshttps://doi.org/10.1145/2463676.2463720openalex-snapshot

Latch-free data structures for DBMS

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/2505305.2505308openalex-snapshot

On the scalability of the Erlang term storage

inferred← citeshttps://doi.org/10.1145/2508075.2508431openalex-snapshot

Effective use of non-blocking data structures in a deduplication application

inferred← citeshttps://doi.org/10.1145/2555243.2555256openalex-snapshot

Fast concurrent lock-free binary search trees

inferred← citeshttps://doi.org/10.1145/2601381.2601393openalex-snapshot

Lock-free pending event set management in time warp

inferred← citeshttps://doi.org/10.1145/2611462.2611495openalex-snapshot

Dynamic-sized nonblocking hash tables

inferred← citeshttps://doi.org/10.1145/2611462.2611500openalex-snapshot

Efficient lock-free binary search trees

inferred← citeshttps://doi.org/10.1145/2611462.2611510openalex-snapshot

Brief announcement

inferred← citeshttps://doi.org/10.1145/2612669.2612687openalex-snapshot

Phase-concurrent hash tables for determinism

inferred← citeshttps://doi.org/10.1145/2612669.2612701openalex-snapshot

Concurrent data structures for efficient streaming aggregation

inferred← citeshttps://doi.org/10.1145/2632362.2632379openalex-snapshot

Towards a GPGPU-parallel SPIN model checker

inferred← citeshttps://doi.org/10.1145/2642937.2642995openalex-snapshot

Concurrent transformation components using contention context sensors

inferred← citeshttps://doi.org/10.1145/2684464.2684472openalex-snapshot

A Fast Lock-Free Internal Binary Search Tree

inferred← citeshttps://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

inferred← citeshttps://doi.org/10.1145/2692916.2555256openalex-snapshot

Fast concurrent lock-free binary search trees

inferred← citeshttps://doi.org/10.1145/2694344.2694359openalex-snapshot

Asynchronized Concurrency

inferred← citeshttps://doi.org/10.1145/2694344.2694374openalex-snapshot

Temporally Bounding TSO for Fence-Free Asymmetric Synchronization

inferred← citeshttps://doi.org/10.1145/2755573.2755579openalex-snapshot

Efficient Memory Management for Lock-Free Data Structures with Optimistic Access

inferred← citeshttps://doi.org/10.1145/2767386.2767403openalex-snapshot

On the Time and Space Complexity of ABA Prevention and Detection

inferred← citeshttps://doi.org/10.1145/2775054.2694359openalex-snapshot

Asynchronized Concurrency

inferred← citeshttps://doi.org/10.1145/2775054.2694374openalex-snapshot

Temporally Bounding TSO for Fence-Free Asymmetric Synchronization

inferred← citeshttps://doi.org/10.1145/2786763.2694359openalex-snapshot

Asynchronized Concurrency

inferred← citeshttps://doi.org/10.1145/2786763.2694374openalex-snapshot

Temporally Bounding TSO for Fence-Free Asymmetric Synchronization

inferred← citeshttps://doi.org/10.1145/2796550openalex-snapshot

Verifying Linearisability

showing the first 200 of 355

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.