Pages that link to "Item:Q760204"

The following pages link to Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204):

Displaying 12 items.

• How evenly should one divide to conquer quickly? (Q800084) (← links)
• A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
• An O(N log N) minimal spanning tree algorithm for N points in the plane (Q1082081) (← links)
• Applications of a strategy for designing divide-and-conquer algorithms (Q1821558) (← links)
• Using fewer processors to reduce time complexities of semigroup computations (Q1823684) (← links)
• Massive parallelization of divide-and-conquer algorithms over powerlists (Q1916359) (← links)
• Strategy-accurate parallel Buchberger algorithms (Q2564821) (← links)
• A data-parallel formulation for divide and conquer algorithms (Q2765229) (← links)
• (Q3369018) (← links)
• Optimizing Givens’ Algorithm for Multiprocessors (Q3804076) (← links)
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Q3833604) (← links)
• Pipelines for Divide-and-Conquer Functions (Q4039036) (← links)