Pages that link to "Item:Q5920146"
From MaRDI portal
The following pages link to Efficient enumeration of non-equivalent squares in partial words with few holes (Q5920146):
Displaying 7 items.
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Squares in partial words (Q2440165) (← links)
- A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE (Q3069745) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- On the number of squares in partial words (Q5190081) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)