New Bounds on Optimal Sorting Networks

DOI10.1007/978-3-319-20028-6_17zbMath1459.68046arXiv1501.06946OpenAlexW1887311811MaRDI QIDQ3195693

Mike Müller, Thorsten Ehlers

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.06946

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (6)

Optimizing sorting algorithms by using sorting networks ⋮ Optimal-depth sorting networks ⋮ Merging almost sorted sequences yields a 24-sorter ⋮ The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks ⋮ Sorting networks: to the end and back again ⋮ Applying Sorting Networks to Synthesize Optimized Sorting Libraries

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting Networks: The End Game
• A computer-assisted optimal depth lower bound for nine-input sorting networks
• Optimal Sorting Networks

This page was built for publication: New Bounds on Optimal Sorting Networks