Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
A Greedy Algorithm for Constructing Shortest Common Superstrings.
Jorma Tarhio
,
Esko Ukkonen
Venue
B
MFCS
Year
1986
Proceedings
MFCS
DBLP record
conf/mfcs/TarhioU86 ↗
Browse the full
MFCS paper archive
.