Accelerating certain outputs of merging and sorting networks

DOI10.1016/J.TCS.2009.04.024zbMath1171.68007OpenAlexW2087323270MaRDI QIDQ837163

Ami Litman, Tamir Levi

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

sortingaccelerationmergingcomparator networkszero-one principle

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

On the complexity of min-max sorting networks ⋮ Optimal conclusive sets for comparator networks

Cites Work

• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• K-way bitonic sort
• Bounds on Selection Networks
• Optimal Conclusive Sets for Comparator Networks

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