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 8 items.
- An efficient algorithm for online square detection (Q860815) (← 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)
- Efficient string matching on packed texts (Q4341037) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- Parallelism and dictionary based data compression (Q5944436) (← links)
