Pages that link to "Item:Q1325834"
From MaRDI portal
The following pages link to Parallel RAM algorithms for factorizing words (Q1325834):
Displaying 15 items.
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- Lyndon-like and V-order factorizations of strings (Q1827280) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS (Q3526553) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- A new class of string transformations for compressed text indexing (Q6053405) (← links)
