Add to ORKGWe present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are clear and easy to explain and implement. All of them are iterative. They can be implemented in the EREW PRAM model using O(k) processors in expected time O(log n + log k).Postprint (published version
Abstmct-In most parallel random access machine (PRAM) models, memory references are assumed to take ...
Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the imp...
Introduction We consider the dictionary problem: Given a set S of n real numbers, store them in a d...
We present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give a...
We present a top down design of a parallel PRAM dictionary using skip lists. More precisely, we give...
AbstractWe present a top-down design of a parallel PRAM dictionary using skip lists. More precisely,...
AVL trees are efficient data structures for implementing dictionaries. We present a parallel diction...
We present a new type of search trees isomorphic to Skip-lists, i.e., there is a one-to-one mapping...
AVL (Adel\u27son-Vel\u27skii and Landis) trees are efficient data structures far implementing dictio...
This papers describes a new approach to providing efficient concurrent access to a dynamic search st...
The goal of a parallel algorithm is to solve a single problem using multiple pro-cessors working tog...
We describe new randomized parallel algorithms for the problems of interval allocation, construction...
(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps ...
List ranking and list scan are two primitive operations used in many parallel algorithms that use li...
We present an optimal algorithm for sorting n integers in the range [1, nc ] (for any constant c) fo...
Abstmct-In most parallel random access machine (PRAM) models, memory references are assumed to take ...
Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the imp...
Introduction We consider the dictionary problem: Given a set S of n real numbers, store them in a d...
We present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give a...
We present a top down design of a parallel PRAM dictionary using skip lists. More precisely, we give...
AbstractWe present a top-down design of a parallel PRAM dictionary using skip lists. More precisely,...
AVL trees are efficient data structures for implementing dictionaries. We present a parallel diction...
We present a new type of search trees isomorphic to Skip-lists, i.e., there is a one-to-one mapping...
AVL (Adel\u27son-Vel\u27skii and Landis) trees are efficient data structures far implementing dictio...
This papers describes a new approach to providing efficient concurrent access to a dynamic search st...
The goal of a parallel algorithm is to solve a single problem using multiple pro-cessors working tog...
We describe new randomized parallel algorithms for the problems of interval allocation, construction...
(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps ...
List ranking and list scan are two primitive operations used in many parallel algorithms that use li...
We present an optimal algorithm for sorting n integers in the range [1, nc ] (for any constant c) fo...
Abstmct-In most parallel random access machine (PRAM) models, memory references are assumed to take ...
Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the imp...
Introduction We consider the dictionary problem: Given a set S of n real numbers, store them in a d...