Pages that link to "Item:Q4327381"
From MaRDI portal
The following pages link to Fast parallel Lyndon factorization with applications (Q4327381):
Displaying 21 items.
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- Optimal algorithms for computing the canonical form of a circular string (Q1190455) (← links)
- Parallel RAM algorithms for factorizing words (Q1325834) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← 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)
- Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- (Q4214993) (← links)
- A fast average case algorithm for lyndon decomposition (Q4876360) (← links)
- (Q5088889) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels (Q6069173) (← links)
