Pages that link to "Item:Q1178198"
From MaRDI portal
The following pages link to Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198):
Displaying 19 items.
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- An efficient algorithm for online square detection (Q860815) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Parallel RAM algorithms for factorizing words (Q1325834) (← links)
- P-complete problems in data compression (Q1325842) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- Lempel-Ziv data compression on parallel and distributed systems (Q1736484) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- Computing equality-free and repetitive string factorisations (Q2634669) (← links)
- Un réseau linéaire pour la reconnaissance des mots sans carré (Q3789096) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- Factorizing a String into Squares in Linear Time (Q5369562) (← links)
- Parallelism and dictionary based data compression (Q5944436) (← links)
- (Q6075975) (← links)
- Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)
- New advances in rightmost Lempel-Ziv (Q6545424) (← links)