A design of a parallel dictionary using skip lists
From MaRDI portal
Recommendations
- An optimal parallel dictionary
- Publication:3031905
- Parallel dictionaries using AVL trees
- The splay-list: a distribution-adaptive concurrent skip-list
- The splay-list: a distribution-adaptive concurrent skip-list
- scientific article; zbMATH DE number 4078826
- Skip lists - some results on a recent data structure
- Skip trees, an alternative data structure to skip lists in a concurrent approach
- Some observations on skip-lists
Cites work
- scientific article; zbMATH DE number 3843145 (Why is no real title available?)
- scientific article; zbMATH DE number 177800 (Why is no real title available?)
- A Generalized Dictionary Machine for VLSI
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A limit theory for random skip lists
- A perfect parallel dictionary
- An optimal parallel dictionary
- Analysis of an optimized search algorithm for skip lists
- Analysis of the expected search cost in skip lists
- Maintaining \(B\)-trees on an EREW PRAM
- Parallel processing: CONPAR 92 - VAPP V. 2nd joint international conference on vector and parallel processing, Lyon, France, September 1- 4, 1992. Proceedings
- Some observations on skip-lists
- Ultracomputers
Cited in
(6)- Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
- A Simple Optimistic Skiplist Algorithm
- Parallel dictionaries with local rules on AVL and brother trees
- Skip trees, an alternative data structure to skip lists in a concurrent approach
- An optimal parallel dictionary
- Analysis of an optimized search algorithm for skip lists
This page was built for publication: A design of a parallel dictionary using skip lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351441)
