The Ford-Johnson algorithm still unbeaten for less than 47 elements
From MaRDI portal
Publication:845913
DOI10.1016/J.IPL.2006.09.001zbMATH Open1185.68881DBLPjournals/ipl/Peczarski07OpenAlexW2081463407WikidataQ30040050 ScholiaQ30040050MaRDI QIDQ845913FDOQ845913
Authors: Marcin Peczarski 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.09.001
Recommendations
Cites Work
- Title not available (Why is that?)
- New results in minimum-comparison sorting
- Title not available (Why is that?)
- Computing the number of mergings with constraints
- Merging of 4 or 5 elements with n elements
- Optimal merging of 2 elements with n elements
- On the Optimality of Linear Merge
- Title not available (Why is that?)
- The Ford-Johnson Sorting Algorithm Is Not Optimal
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Tournament Problem
Cited In (12)
- Small Complexity Gaps for Comparison-Based Sorting
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variant of the Ford-Johnson algorithm that is more space efficient
- Towards optimal sorting of 16 elements
- Merging of 4 or 5 elements with n elements
- On the average case of MergeInsertion
- On partial sorting in restricted rounds
- 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)
