Optimal parallel quicksort on EREW PRAM

DOI10.1007/BF01952784MaRDI QIDQ751287zbMATH OpenOpenAlexFDO

Authors Weixiong Zhang, N. S. V. Rao

Publication date 1991

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01952784

zbMATH Keywords

parallel algorithmsquicksortEREW PRAMbinary search treesquickhull

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 784426
• Optimal merging and sorting on the EREW PRAM
• On parallel integer sorting
• An efficient parallel sorting algorithm
• Towards optimal parallel bucket sorting

Cites work

• scientific article; zbMATH DE number 3938577 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• A note on the height of binary search trees
• A simple parallel tree contraction algorithm
• Binary tree algebraic computation and parallel algorithms for simple graphs
• Dynamic parallel memories
• Efficient parallel algorithms for graph problems
• Implementation of simultaneous memory address access in models that forbid it
• Parallel Merge Sort
• Parallel computational geometry
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(3)

• scientific article; zbMATH DE number 784426 (Why is no real title available?)
• scientific article; zbMATH DE number 1775345 (Why is no real title available?)
• Improved bounds for integer sorting in the EREW PRAM model

This page was built for publication: Optimal parallel quicksort on EREW PRAM

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