Sorting by distributive partitioning

DOI10.1016/0020-0190(78)90028-5zbMath0373.68034OpenAlexW1999447420MaRDI QIDQ1244813

Wlodzimierz Dobosiewicz

Publication date: 1978

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90028-5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (18)

A randomized parallel branch-and-bound algorithm ⋮ Selection by distributive partitioning ⋮ Average time behavior of distributive sorting algorithms ⋮ The design and analysis of a new hybrid sorting algorithm ⋮ The multilevel principle applied to sorting ⋮ Usort: An efficient hybrid of distributive partitioning sorting ⋮ Sorting numbers in linear expected time and optimal extra space ⋮ Parallel distributive partitioned sorting methods ⋮ Sorting numbers using limited systolic coprocessors ⋮ Bibliography on the evaluation of numerical software ⋮ Complexity of sorting by distributive partitioning ⋮ A space efficient distributive sort ⋮ Analysis of N-trees ⋮ Linear sorting with O(log n) processors ⋮ The asymptotic behaviour of a distributive sorting method ⋮ Some results on tries with adaptive branching. ⋮ Sorting in linear expected time ⋮ An efficient external sorting algorithm

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The analysis of Quicksort programs
• Finding the median
• Time bounds for selection

This page was built for publication: Sorting by distributive partitioning