Pages that link to "Item:Q2547204"
From MaRDI portal
The following pages link to Optimal merging of 2 elements with n elements (Q2547204):
Displaying 9 items.
- The Ford-Johnson algorithm still unbeaten for less than 47 elements (Q845913) (← links)
- Efficient algorithms for merging (Q1056542) (← links)
- Merging of 4 or 5 elements with n elements (Q1157175) (← links)
- Group testing with two defectives (Q1164364) (← links)
- An improvement of the binary merge algorithm (Q1168745) (← links)
- Reaching the bound in the \((2,n)\) merging problem (Q1818797) (← links)
- On the optimality of tape merge of two lists with similar size (Q2182103) (← links)
- On the upper bound of the complexity of sorting (Q2662813) (← links)
- Improved average complexity for comparison-based sorting (Q5919334) (← links)
