The following pages link to Sorting X + Y (Q4060389):
Displayed 13 items.
- Sparse polynomial division using a heap (Q540332) (← links)
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- Selection in \(X+Y\) and matrices with sorted rows and columns (Q761793) (← links)
- A parallel selection algorithm (Q798002) (← links)
- Ernst G. Straus (1922-1983) (Q800339) (← links)
- Parallel multiplication and powering of polynomials (Q808710) (← links)
- The complexity of searching in \(X+Y\) and other multisets (Q911276) (← links)
- Complexity of selection in \(X+Y\) (Q1124333) (← links)
- Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons (Q1199530) (← links)
- How good is the information theory bound in sorting? (Q1226391) (← links)
- Lower bounds for sorting of sums (Q1262763) (← links)
- Optimal slope selection via cuttings (Q1388130) (← links)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)