Efficient parallel algorithms to test square-freeness and factorize strings

Document type :
Journal articles
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, April 11, 2018 - 12:12:02 PM

Identifiers

  • HAL Id : hal-00619585, version 1

Collections

Citation

Maxime Crochemore, Wojciech Rytter. Efficient parallel algorithms to test square-freeness and factorize strings. Information Processing Letters, Elsevier, 1991, 38 (2), pp.57-60. ⟨hal-00619585⟩

Share

Metrics

Record views

165