Computing primitively-rooted squares and runs in partial words (Q1678102): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2017.07.020 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal off-line detection of repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of maximal repetitions by Lyndon trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Combinatorics on Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squares and primitivity in partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squares in partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity algorithms and a conjecture on overlaps in partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Primitively-Rooted Squares and Runs in Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the repetitions in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal repetitions in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in strings: algorithms and combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ``runs'' conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Queries and Updates on Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not So Many Runs in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the numbers of runs and microruns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of squares in partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3518705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On primary and secondary repetitions in words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity Algorithms for Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many runs can a string contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of runs in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565863 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2017.07.020 / rank
 
Normal rank

Latest revision as of 02:49, 11 December 2024

scientific article
Language Label Description Also known as
English
Computing primitively-rooted squares and runs in partial words
scientific article

    Statements

    Computing primitively-rooted squares and runs in partial words (English)
    0 references
    0 references
    14 November 2017
    0 references

    Identifiers