New results in minimum-comparison sorting
From MaRDI portal
Publication:1882531
DOI10.1007/s00453-004-1100-7zbMath1088.68043OpenAlexW2061246500MaRDI QIDQ1882531
Publication date: 1 October 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1100-7
Related Items (11)
Decision trees with minimum average depth for sorting eight elements ⋮ The Ford-Johnson algorithm still unbeaten for less than 47 elements ⋮ Small Complexity Gaps for Comparison-Based Sorting ⋮ Posets with seven linear extensions sortable by three comparisons ⋮ Counting linear extensions: parameterizations by treewidth ⋮ The gold partition conjecture for 6-thin posets ⋮ Finding an Unknown Acyclic Orientation of a Given Graph ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ On the average case of MergeInsertion ⋮ Improved average complexity for comparison-based sorting ⋮ A faster tree-decomposition based algorithm for counting linear extensions
This page was built for publication: New results in minimum-comparison sorting
