Merging almost sorted sequences yields a 24-sorter

DOI10.1016/J.IPL.2016.08.005MaRDI QIDQ344521zbMATH OpenOpenAlexFDO

Authors Thorsten Ehlers

Publication date 23 November 2016

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

Full work available at URL https://doi.org/10.1016/j.ipl.2016.08.005

zbMATH Keywords

theory of computationparallel processingsorting networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• New Bounds on Optimal Sorting Networks
• Constructing sorting networks from k-sorters
• Networks for sorting multitonic sequences
• Sorting networks: to the end and back again
• Optimal sorting networks

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• New Bounds on Optimal Sorting Networks
• Optimal sorting networks
• Sorting in \(c \log n\) parallel steps
• Sorting networks: the end game
• Theory and Applications of Satisfiability Testing
• Using symmetry and evolutionary search to minimize sorting networks

Describes a project that uses

Uses Software

• MiniSat

This page was built for publication: Merging almost sorted sequences yields a 24-sorter

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