Optimal parallel quicksort on EREW PRAM

DOI10.1007/BF01952784zbMath0714.68045OpenAlexW2074456838MaRDI QIDQ751287

Nageswara S. V. Rao, Weixiong Zhang

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 algorithmsbinary search treesquicksortEREW PRAMquickhull

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel computational geometry
• Efficient parallel algorithms for graph problems
• Dynamic parallel memories
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• Binary tree algebraic computation and parallel algorithms for simple graphs
• Parallel Merge Sort
• A note on the height of binary search trees
• The Parallel Evaluation of General Arithmetic Expressions
• A simple parallel tree contraction algorithm
• Implementation of simultaneous memory address access in models that forbid it

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