Pages that link to "Item:Q1882531"
From MaRDI portal
The following pages link to New results in minimum-comparison sorting (Q1882531):
Displaying 11 items.
- Decision trees with minimum average depth for sorting eight elements (Q266840) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- The Ford-Johnson algorithm still unbeaten for less than 47 elements (Q845913) (← links)
- The gold partition conjecture for 6-thin posets (Q943372) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- Posets with seven linear extensions sortable by three comparisons (Q1944901) (← links)
- Finding an Unknown Acyclic Orientation of a Given Graph (Q3557528) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- On the average case of MergeInsertion (Q5918284) (← links)
- Improved average complexity for comparison-based sorting (Q5919334) (← links)
- Small Complexity Gaps for Comparison-Based Sorting (Q6163631) (← links)