A work-time optimal algorithm for computing all string covers (Q671438): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(96)00047-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992597116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for periods, palindromes and squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient detection of quasiperiodicities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal superprimitivity testing for strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Star-Tree Parallel Data Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing string superprimitivity in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Parallel String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Simplicity of Compaction and Chaining / rank
 
Normal rank

Latest revision as of 10:58, 27 May 2024

scientific article
Language Label Description Also known as
English
A work-time optimal algorithm for computing all string covers
scientific article

    Statements

    A work-time optimal algorithm for computing all string covers (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    repetitive structures of strings
    0 references
    0 references