A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word

Abstract

no abstract

Dates and versions

hal-01588525 , version 1 (15-09-2017)

Identifiers

Cite

Thierry Garcia, David Semé. A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word. Computational Science and Its Applications ―- ICCSA 2003: International Conference Montreal, Canada, May 18―21, 2003 Proceedings, Part II, 2003, Montreal, Canada. pp.239--248, ⟨10.1007/3-540-44843-8_26⟩. ⟨hal-01588525⟩
32 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More