Pages that link to "Item:Q3315005"
From MaRDI portal
The following pages link to Factorizing words over an ordered alphabet (Q3315005):
Displayed 50 items.
- Efficient operations on discrete paths (Q265059) (← links)
- Finding the leftmost critical factorization on unordered alphabet (Q290524) (← links)
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm (Q323035) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time (Q391391) (← links)
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- A note on a simple computation of the maximal suffix of a string (Q396649) (← links)
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- Finding the maximum suffix with fewer comparisons (Q635741) (← links)
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- New results on Nyldon words and Nyldon-like sets (Q820920) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- A public key cryptosystem based on Lyndon words (Q918715) (← links)
- A formula for the determinant of a sum of matrices (Q1092976) (← links)
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length) (Q1121024) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- Combinatorics of Hall trees and Hall words (Q1185905) (← links)
- String-matching on ordered alphabets (Q1190451) (← links)
- Optimal algorithms for computing the canonical form of a circular string (Q1190455) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Lyndon trees (Q1202932) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Lyndon words and singular factors of sturmian words (Q1292480) (← links)
- Infinite Lyndon words (Q1322121) (← links)
- Parallel RAM algorithms for factorizing words (Q1325834) (← links)
- Average cost of Duval's algorithm for generating Lyndon words (Q1334678) (← links)
- Viennot factorization of infinite words (Q1350922) (← links)
- The zooming method: A recursive approach to time-space efficient string-matching (Q1367541) (← links)
- Lyndon words, permutations and trees. (Q1426043) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- Enhanced string factoring from alphabet orderings (Q1711413) (← links)
- Geometric preservation of 2D digital objects under rigid motions (Q1722617) (← links)
- The standard factorization of Lyndon words: an average point of view (Q1764900) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- Lyndon-like and V-order factorizations of strings (Q1827280) (← links)
- On maximal suffixes and constant-space linear-time versions of KMP algorithm. (Q1874422) (← links)
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids (Q1901039) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)