An 11-step sorting network for 18 elements

DOI10.1142/S0129626409000092MaRDI QIDQ6483523zbMATH OpenFDO

Authors Sherenaz W. Al-Haj Baddar, Kenneth E. Batcher

Publication date 29 September 2010

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129626409000092

zbMATH Keywords

multistage interconnection networksparallel sorting algorithmspartial orderingsorting networkszero/one principle

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• New Bounds on Optimal Sorting Networks
• scientific article; zbMATH DE number 1156609
• Sorting networks: to the end and back again
• Optimizing sorting algorithms by using sorting networks
• The periodic balanced sorting network

Cited in

(2)

• scientific article; zbMATH DE number 1156609 (Why is no real title available?)
• On the complexity of min-max sorting networks

This page was built for publication: An 11-step sorting network for 18 elements

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