scientific article; zbMATH DE number 3825195

zbMATH Open0521.68070MaRDI QIDQ3670587FDOQ3670587

Authors: Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener 

Publication date: 1983

Title of this publication is not available (Why is that?)

zbMATH Keywords

parallel computationsearching2- 3 treeparallel computer with synchronized processorsrandom access storage

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of operating systems (68N25)

Cited In (9)

• Parallel heap: an optimal parallel priority queue
• Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
• Processor-efficient implementation of a maximum flow algorithm
• Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
• 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 parallel uniform hashing
• Parallel cardinality stacks and an application
• Parallel algorithms for red--black trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670587)