A computer-assisted optimal depth lower bound for nine-input sorting networks
From MaRDI portal
Publication:3210158
Recommendations
Cites work
- scientific article; zbMATH DE number 4068238 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3409355 (Why is no real title available?)
- A Sorting Problem
- An Improved Lower Bound for Sorting Networks
- Efficient generation of the binary reflected gray code and its applications
- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
- Single-exception sorting networks and the computational complexity of optimal sorting network verification
- Sorting in \(c \log n\) parallel steps
Cited in
(10)- Formally proving size optimality of sorting networks
- New Bounds on Optimal Sorting Networks
- Optimizing sorting algorithms by using sorting networks
- Single-exception sorting networks and the computational complexity of optimal sorting network verification
- Formalizing size-optimal sorting networks: extracting a certified proof checker
- Sorting nine inputs requires twenty-five comparisons
- Optimal sorting networks
- Sorting networks: to the end and back again
- Optimal-depth sorting networks
- Applying sorting networks to synthesize optimized sorting libraries
This page was built for publication: A computer-assisted optimal depth lower bound for nine-input sorting networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210158)
