New results in minimum-comparison sorting
From MaRDI portal
Publication:1882531
DOI10.1007/s00453-004-1100-7zbMath1088.68043MaRDI 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
68P10: Searching and sorting
Related Items
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions, On the average case of MergeInsertion, Improved average complexity for comparison-based sorting, Small Complexity Gaps for Comparison-Based Sorting, Decision trees with minimum average depth for sorting eight elements, A faster tree-decomposition based algorithm for counting linear extensions, The Ford-Johnson algorithm still unbeaten for less than 47 elements, The gold partition conjecture for 6-thin posets, Counting linear extensions: parameterizations by treewidth, Posets with seven linear extensions sortable by three comparisons, Finding an Unknown Acyclic Orientation of a Given Graph