Space-efficient algorithms for longest increasing subsequence (Q1987516)

From MaRDI portal
Revision as of 00:10, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Space-efficient algorithms for longest increasing subsequence
scientific article

    Statements

    title
    Space-efficient algorithms for longest increasing subsequence (English)
    0 references
    author
    Masashi Kiyomi
    0 references
    Hirotaka Ono
    0 references
    Yota Otachi
    0 references
    Pascal Schweitzer
    0 references
    Jun Tarui
    0 references
    publication date
    15 April 2020
    0 references
    Mathematics Subject Classification ID
    68W32
    0 references
    11Y16
    0 references
    11Y55
    0 references
    68P10
    0 references
    68W40
    0 references
    zbMATH DE Number
    7189483
    0 references
    zbMATH Keywords
    longest increasing subsequence
    0 references
    patience sorting
    0 references
    space-efficient algorithm
    0 references
    OpenAlex ID
    W2913517735
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1987516&oldid=32326374"
    Powered by MediaWiki