The following pages link to (Q4342907):
Displaying 6 items.
- A generalization of the 0-1 principle for sorting (Q1041721) (← links)
- Upper and lower bounds for selection on the mesh (Q1386351) (← links)
- The calculation of average distance in mesh structures. (Q1416347) (← links)
- Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
- On the Average Running Time of Odd–Even Merge Sort (Q3128198) (← links)
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes (Q6102292) (← links)