Sorting by distributive partitioning

DOI10.1016/0020-0190(78)90028-5MaRDI QIDQ1244813zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Finding the median
• The analysis of Quicksort programs
• Time bounds for selection

Cited in

(18)

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

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: Sorting by distributive partitioning

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