Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.
Vlado Danck
,
Mike Paterson
Venue
A
STACS
Year
1994
Proceedings
STACS
DBLP record
conf/stacs/DancikP94 ↗
Browse the full
STACS paper archive
.