scientific article; zbMATH DE number 3409355
From MaRDI portal
Publication:5675725
Cited in
(9)- Sorting in one round
- Formally proving size optimality of sorting networks
- Finding the n-th largest element
- Formalizing size-optimal sorting networks: extracting a certified proof checker
- A computer-assisted optimal depth lower bound for nine-input sorting networks
- Single-exception sorting networks and the computational complexity of optimal sorting network verification
- Optimal-depth sorting networks
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
- Sorting nine inputs requires twenty-five comparisons
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675725)
