Pages that link to "Item:Q594601"

The following pages link to Optimal parallel algorithms for computing convex hulls and for sorting (Q594601):

Displaying 13 items.

• On the complexity of min-max sorting networks (Q454886) (← links)
• Optimal parallel selection in sorted matrices (Q671400) (← links)
• Perfectly overlapped merging and sorting on a two-way linear array (Q673341) (← links)
• A unified algorithm for sorting on multidimensional mesh-connected processors (Q751246) (← links)
• A generalization of the zero-one principle for sorting algorithms (Q751248) (← links)
• Parallel algorithms for merging and sorting (Q751797) (← links)
• Constant time sorting on a processor array with a reconfigurable bus system (Q915452) (← links)
• Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
• On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
• Sorting and computing convex hulls on processor arrays with reconfigurable bus systems (Q1310923) (← links)
• Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
• Permutation algorithms on optical multi-trees (Q2389510) (← links)
• (Q5091039) (← links)