A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738)

From MaRDI portal
Revision as of 15:12, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    11 April 2014
    0 references
    0 references
    parallel algorithms
    0 references
    longest increasing subsequence
    0 references
    divide and conquer
    0 references
    0 references
    0 references
    0 references
    0 references