Efficient parallel algorithms to test square-freeness and factorize strings - Archive ouverte HAL Access content directly
Journal Articles Information Processing Letters Year : 1991

Efficient parallel algorithms to test square-freeness and factorize strings

Wojciech Rytter
  • Function : Author
No file

Dates and versions

hal-00619585 , version 1 (06-09-2011)

Identifiers

  • HAL Id : hal-00619585 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More