Publication:3670587
From MaRDI portal
zbMath0521.68070MaRDI QIDQ3670587
Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
Publication date: 1983
parallel computation; searching; 2- 3 tree; parallel computer with synchronized processors; random access storage
Related Items
Skip trees, an alternative data structure to skip lists in a concurrent approach, Parallel algorithms for red--black trees, Analysis of parallel uniform hashing, Parallel heap: an optimal parallel priority queue, Processor-efficient implementation of a maximum flow algorithm, Parallel cardinality stacks and an application, Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model, Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.