Applying Sorting Networks to Synthesize Optimized Sorting Libraries

DOI10.1007/978-3-319-27436-2_8zbMath1362.68062arXiv1505.01962OpenAlexW1518055973MaRDI QIDQ5743589

No author found.

Publication date: 5 February 2016

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Optimizing sorting algorithms by using sorting networks ⋮ Optimal-depth sorting networks ⋮ Sorting networks: to the end and back again

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The analysis of Quicksort programs
• Sorting Networks: The End Game
• New Bounds on Optimal Sorting Networks
• A computer-assisted optimal depth lower bound for nine-input sorting networks
• Optimal Sorting Networks
• Quicksort

This page was built for publication: Applying Sorting Networks to Synthesize Optimized Sorting Libraries