Accelerating certain outputs of merging and sorting networks

DOI10.1016/J.TCS.2009.04.024MaRDI QIDQ837163zbMATH OpenOpenAlexFDO

Authors Tamir Levi, Ami Litman

Publication date 10 September 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.04.024

zbMATH Keywords

accelerationsortingmergingcomparator networkszero-one principle

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Merging in mixed radix sorting networks
• Slowing down sorting networks to obtain faster sorting algorithms
• Faster merging networks with a small constant period
• On optimal parallelization of sorting networks
• scientific article; zbMATH DE number 4031004
• Optimizing sorting algorithms by using sorting networks
• scientific article; zbMATH DE number 1156609
• The asymptotic complexity of merging networks
• scientific article; zbMATH DE number 1256659

Cites work

• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Bounds on Selection Networks
• K-way bitonic sort
• Optimal Conclusive Sets for Comparator Networks
• Sorting in \(c \log n\) parallel steps

Cited in

(8)

• scientific article; zbMATH DE number 1256659 (Why is no real title available?)
• scientific article; zbMATH DE number 1951553 (Why is no real title available?)
• A generalization of the 0-1 principle for sorting
• On the complexity of min-max sorting networks
• A sequential sorting network analogous to the batcher merge
• The strongest model of computation obeying 0-1 Principles
• Optimal conclusive sets for comparator networks
• Combining Networks Using Cherry Picking Sequences

This page was built for publication: Accelerating certain outputs of merging and sorting networks

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