Optimal Parallel Sorting Scheme by Order Statistics

DOI10.1137/0216063MaRDI QIDQ3801083zbMATH OpenOpenAlexFDO

Authors Mark C. K. Yang, Jun-Shon Huang, Yuan-Chieh Chow

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0216063

zbMATH Keywords

samplingorder statisticstime complexityparallel sortingdata partitionparallel balanced tree sort

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Parallel sorting by regular sampling
• scientific article; zbMATH DE number 3938577
• On the versatility of parallel sorting by regular sampling
• scientific article; zbMATH DE number 1003299
• Parallel distributive partitioned sorting methods

Cited in

(1)

• Engineering parallel string sorting

This page was built for publication: Optimal Parallel Sorting Scheme by Order Statistics

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