scientific article
From MaRDI portal
Publication:3670587
zbMath0521.68070MaRDI QIDQ3670587
Hubert Wagener, Wolfgang J. Paul, Uzi Vishkin
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel computationsearching2- 3 treeparallel computer with synchronized processorsrandom access storage
Related Items
Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. ⋮ Parallel dictionaries with local rules on AVL and brother trees ⋮ Processor-efficient implementation of a maximum flow algorithm ⋮ Parallel cardinality stacks and an application ⋮ Skip trees, an alternative data structure to skip lists in a concurrent approach ⋮ Parallel heap: an optimal parallel priority queue ⋮ Parallel algorithms for red--black trees ⋮ Analysis of parallel uniform hashing ⋮ Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model