Efficient parallel algorithms to test square-freeness and factorize strings

Maxime Crochemore; Wojciech Rytter

Journal articles

Efficient parallel algorithms to test square-freeness and factorize strings

Maxime Crochemore ¹ Wojciech Rytter

1 ligm - Laboratoire d'Informatique Gaspard-Monge

Document type :

Journal articles

Domain :

Computer Science [cs] / Data Structures and Algorithms [cs.DS]

Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00619585
Contributor : Maxime Crochemore <>
Submitted on : Tuesday, September 6, 2011 - 3:53:34 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM

Efficient parallel algorithms to test square-freeness and factorize strings

Identifiers

Collections

Citation

Export

Metrics

200

Efficient parallel algorithms to test square-freeness and factorize strings

Identifiers

Collections

Citation

Export

Share

Metrics

200