Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Q3833604)
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: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms |
scientific article; zbMATH DE number 4110086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms |
scientific article; zbMATH DE number 4110086 |
Statements
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (English)
0 references
1989
0 references
divide-and-conquer
0 references
parallel algorithms
0 references
parallel data structures
0 references
computational geometry
0 references
intersection detection
0 references
trapezoidal decomposition
0 references
planar point location
0 references
fractional cascading
0 references
dominance
0 references
visibility
0 references
0.7867994904518127
0 references
0.7826932668685913
0 references
0.7812833189964294
0 references
0.7736403942108154
0 references
0.7721185684204102
0 references
