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 the normal view instead:
scientific article; zbMATH DE number 6282804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem |
scientific article; zbMATH DE number 6282804 |
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
0.9036632776260376
0 references
0.7854487895965576
0 references
0.7779417634010315
0 references
0.7621660232543945
0 references
0.7557383179664612
0 references
