The Ford-Johnson algorithm still unbeaten for less than 47 elements
From MaRDI portal
(Redirected from Publication:845913)
Recommendations
Cites work
- scientific article; zbMATH DE number 3574969 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1947440 (Why is no real title available?)
- scientific article; zbMATH DE number 3342010 (Why is no real title available?)
- scientific article; zbMATH DE number 3388544 (Why is no real title available?)
- A Tournament Problem
- Computing the number of mergings with constraints
- Merging of 4 or 5 elements with n elements
- New results in minimum-comparison sorting
- On the Optimality of Linear Merge
- Optimal merging of 2 elements with n elements
- The Ford-Johnson Sorting Algorithm Is Not Optimal
Cited in
(12)- Small Complexity Gaps for Comparison-Based Sorting
- scientific article; zbMATH DE number 1947440 (Why is no real title available?)
- scientific article; zbMATH DE number 4001496 (Why is no real title available?)
- A variant of the Ford-Johnson algorithm that is more space efficient
- Merging of 4 or 5 elements with n elements
- Towards optimal sorting of 16 elements
- On partial sorting in restricted rounds
- On the average case of MergeInsertion
- On the upper bound of the complexity of sorting
- Posets with seven linear extensions sortable by three comparisons
- Significant improvements to the Ford-Johnson algorithm for sorting
- Lower bounds for sorting 16, 17, and 18 elements
This page was built for publication: The Ford-Johnson algorithm still unbeaten for less than 47 elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845913)
