A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738)
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 divide and conquer approach and a work-optimal parallel algorithm for the LIS problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem |
scientific article |
Statements
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (English)
0 references
11 April 2014
0 references
parallel algorithms
0 references
longest increasing subsequence
0 references
divide and conquer
0 references
