Skip to Main content Skip to Navigation
Journal articles

Efficient parallel algorithms to test square-freeness and factorize strings

Maxime Crochemore 1 Wojciech Rytter 
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
Document type :
Journal articles
Complete list of metadata
https://hal-upec-upem.archives-ouvertes.fr/hal-00619585
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Tuesday, September 6, 2011 - 3:53:34 PM
Last modification on : Saturday, January 15, 2022 - 3:57:15 AM

Identifiers

  • HAL Id : hal-00619585, version 1

Collections

ENPC | UPEC-UPEM | CNRS | UNIV-MLV | LIGM_ALGO | PARISTECH | LIGM

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

57