A design of a parallel dictionary using skip lists
- 20 May 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 158 (1-2) , 1-33
- https://doi.org/10.1016/0304-3975(94)00288-6
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Analysis of an optimized search algorithm for skip listsTheoretical Computer Science, 1995
- The path length of random skip listsActa Informatica, 1994
- Maintaining B-Trees on an EREW PRAMJournal of Parallel and Distributed Computing, 1994
- An Approach to Correctness of Data Parallel AlgorithmsJournal of Parallel and Distributed Computing, 1994
- A Limit Theory for Random Skip ListsThe Annals of Applied Probability, 1992
- Dynamic Hashing in Real TimePublished by Springer Nature ,1992
- Scans as primitive parallel operationsIEEE Transactions on Computers, 1989
- Data parallel algorithmsCommunications of the ACM, 1986
- A Generalized Dictionary Machine for VLSIIEEE Transactions on Computers, 1985
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952