scientific article; zbMATH DE number 3409355
From MaRDI portal
Publication:5675725
zbMATH Open0259.05005MaRDI QIDQ5675725FDOQ5675725
Donald E. Knuth, Robert W. Floyd
Publication date: 1973
Title of this publication is not available (Why is that?)
Cited In (9)
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
- Finding the \(\alpha n\)-th largest element
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
- Single-exception sorting networks and the computational complexity of optimal sorting network verification
- A computer-assisted optimal depth lower bound for nine-input sorting networks
- Sorting in one round
- Optimal-depth sorting networks
- Sorting nine inputs requires twenty-five comparisons
- Formally proving size optimality of sorting networks
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)
