Skip trees, an alternative data structure to skip lists in a concurrent approach
From MaRDI portal
Publication:4361577
DOI10.1051/ita/1997310302511zbMath0889.68115OpenAlexW1482797705MaRDI QIDQ4361577
Publication date: 11 June 1998
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92561
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some observations on skip-lists
- Average search and update costs in skip lists
- A limit theory for random skip lists
- On the correspondence between AVL trees and brother trees
- Maintaining \(B\)-trees on an EREW PRAM
- A design of a parallel dictionary using skip lists
- Chromatic binary search trees: A structure for concurrent rebalancing
- Randomized search trees
- Relaxed avl trees, main-memory databases and concurrency
- On-the-fly optimization of data structures
- Optimal pagination of B-trees with variable-length items
- On-the-fly garbage collection
- The higher moments of the number of returns of a simple random walk
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Skip trees, an alternative data structure to skip lists in a concurrent approach
