Optimal parallel quicksort on EREW PRAM

DOI10.1007/BF01952784zbMATH Open0714.68045OpenAlexW2074456838MaRDI QIDQ751287FDOQ751287

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

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

zbMATH Keywords

parallel algorithmsquicksortEREW PRAMbinary search treesquickhull

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)