A design of a parallel dictionary using skip lists

DOI10.1016/0304-3975(94)00288-6zbMath0871.68066OpenAlexW2012833374WikidataQ61734817 ScholiaQ61734817MaRDI QIDQ1351441

Joaquim Gabarró, Xavier Messeguer, Conrado Martínez

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00288-6

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (4)

Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. ⋮ Parallel dictionaries with local rules on AVL and brother trees ⋮ Skip trees, an alternative data structure to skip lists in a concurrent approach ⋮ Analysis of an optimized search algorithm for skip lists

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of an optimized search algorithm for skip lists
• Some observations on skip-lists
• A limit theory for random skip lists
• Parallel processing: CONPAR 92 - VAPP V. 2nd joint international conference on vector and parallel processing, Lyon, France, September 1- 4, 1992. Proceedings
• An optimal parallel dictionary
• Maintaining \(B\)-trees on an EREW PRAM
• A Generalized Dictionary Machine for VLSI
• Ultracomputers
• Analysis of the expected search cost in skip lists
• A perfect parallel dictionary
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: A design of a parallel dictionary using skip lists