A data-parallel formulation for divide and conquer algorithms (Q2765229)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A data-parallel formulation for divide and conquer algorithms |
scientific article; zbMATH DE number 1694335
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A data-parallel formulation for divide and conquer algorithms |
scientific article; zbMATH DE number 1694335 |
Statements
23 January 2002
0 references
mapping vectors
0 references
index-digit permutations
0 references
space-filling curves
0 references
high performance Fortran
0 references
0.91013324
0 references
0.90526134
0 references
0.9047302
0 references
0.88769346
0 references
0.8861764
0 references
0.88453597
0 references
A data-parallel formulation for divide and conquer algorithms (English)
0 references
