Pages that link to "Item:Q2634669"
From MaRDI portal
The following pages link to Computing equality-free and repetitive string factorisations (Q2634669):
Displaying 9 items.
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- Enhanced string factoring from alphabet orderings (Q1711413) (← links)
- String factorisations with maximum or minimum dimension (Q2006777) (← links)
- The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps (Q3297782) (← links)
- (Q4599213) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- Factorizing a String into Squares in Linear Time (Q5369562) (← links)
- (Q6075975) (← links)