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

DOI10.4230/LIPICS.DISC.2020.3zbMATH Open1543.68097MaRDI QIDQ6535000

Dan Alistarh, Vitaly Aksenov, Alexandra Drozdova, Amirkeivan Mohtashami

Publication date: 2 November 2023

zbMATH Keywords

data structuresconcurrencyself-adjusting

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-adjusting multi-way search trees
• Biased skip lists
• Alternatives to splay trees with \(O(\log n)\) worst-case access times
• The topological structure of asynchronous computability
• Self-adjusting binary search trees
• CBTree: A Practical Concurrent Self-Adjusting Search Tree
• A Template for Implementing Fast Lock-free Trees Using HTM
• A Simple Optimistic Skiplist Algorithm

Related Items (2)

A design of a parallel dictionary using skip lists ⋮ Skip-Splay: Toward Achieving the Unified Bound in the BST Model

This page was built for publication: The splay-list: a distribution-adaptive concurrent skip-list

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535000)