Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CSR
/
Paper
Computing Longest Common Substrings Via Suffix Arrays.
Maxim A. Babenko
,
Tatiana Starikovskaya
Venue
National
CSR
Year
2008
Proceedings
CSR
DBLP record
conf/csr/BabenkoS08 ↗
Browse the full
CSR paper archive
.