Shortest unique palindromic substring queries in optimal time (Q1642725)

From MaRDI portal
Revision as of 21:13, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Shortest unique palindromic substring queries in optimal time
scientific article

    Statements

    title
    Shortest unique palindromic substring queries in optimal time (English)
    0 references
    author
    Yuto Nakashima
    0 references
    Hiroe Inoue
    0 references
    Takuya Mieno
    0 references
    Shunsuke Inenaga
    0 references
    Hideo Bannai
    0 references
    Masayuki Takeda
    0 references
    publication date
    15 June 2018
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W32
    0 references
    68P05
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6890134
    0 references
    OpenAlex ID
    W2524786565
    0 references
    arXiv ID
    1608.05550
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1642725&oldid=33396274"
    Powered by MediaWiki