Pages that link to "Item:Q2765229"
From MaRDI portal
The following pages link to A data-parallel formulation for divide and conquer algorithms (Q2765229):
Displaying 6 items.
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- A `division' transformation for program and data structures and the structure clash problem (Q1102733) (← links)
- Parallelization of divide-and-conquer in the Bird-Meertens formalism (Q1906040) (← links)
- Massive parallelization of divide-and-conquer algorithms over powerlists (Q1916359) (← links)
- Parallelization of divide-and-conquer by translation to nested loops (Q4934239) (← links)
- (Q5382053) (← links)