The “Runs” Theorem (Q5359492): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A new characterization of maximal repetitions by Lyndon trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the action of the symmetric group on the free Lie algebra and the partition lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal number of runs in standard Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon + Christoffel = digitally convex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic musical sequences and Lyndon words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Practical Algorithms for Computing All the Runs in a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free differential calculus. IV: The quotient groups of the lower central series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing longest previous factor in linear time and applications / 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: The maximal number of cubic runs in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting powers and periods in a word from its runs structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal sum of exponents of runs in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(d\)-step approach to the maximum number of distinct squares and runs in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic geoleader election in disoriented anonymous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle formation of weak robots and Lyndon words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE / 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: Representations of quiver Hecke algebras via Lyndon bases. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon words, permutations and trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Construction of Suffix Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient linear time construction of suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal Pattern Matching Queries in a Text and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing runs on a general alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Standard Lyndon Bases of Lie Algebras and Enveloping Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Burnside's Problem / 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: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon Words and Short Superstrings / 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: Q3134850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Runs in a String: Improved Analysis of the Linear Upper Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitive perhaps, but certainly not boring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing regularities in strings: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale detection of repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying look at data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2199929370 / rank
 
Normal rank

Latest revision as of 10:29, 30 July 2024

scientific article; zbMATH DE number 6779773
Language Label Description Also known as
English
The “Runs” Theorem
scientific article; zbMATH DE number 6779773

    Statements

    The “Runs” Theorem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2017
    0 references
    0 references
    maximal repetitions
    0 references
    Lyndon words
    0 references
    combinatorics on words
    0 references
    string algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references