The following pages link to A Tournament Problem (Q5895867):
Displaying 21 items.
- The Ford-Johnson algorithm still unbeaten for less than 47 elements (Q845913) (← links)
- A variant of the Ford-Johnson algorithm that is more space efficient (Q846008) (← links)
- Significant improvements to the Ford-Johnson algorithm for sorting (Q1064782) (← links)
- Merging of 4 or 5 elements with n elements (Q1157175) (← links)
- Time bounds for selection (Q1394121) (← links)
- Two entropies of a generalized sorting problem (Q1394125) (← links)
- Posets with seven linear extensions sortable by three comparisons (Q1944901) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Maximal k-decomposible sets of permutations of degree n (Q2528670) (← links)
- An experiment in optimal sorting (Q2552379) (← links)
- An efficient algorithm for determining the convex hull of a finite planar set (Q2552382) (← links)
- On the upper bound of the complexity of sorting (Q2662813) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Path Problems in Complex Networks (Q2913787) (← links)
- Finding an Unknown Acyclic Orientation of a Given Graph (Q3557528) (← links)
- Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires (Q4401949) (← links)
- (Q4993558) (← links)
- On the average case of MergeInsertion (Q5918284) (← links)
- Improved average complexity for comparison-based sorting (Q5919334) (← links)
