Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LATA
/
Paper
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem.
Francine Blanchet-Sadri
,
Justin Lazarow
Venue
C
LATA
Year
2013
Proceedings
LATA
DBLP record
conf/lata/Blanchet-SadriL13 ↗
Browse the full
LATA paper archive
.