Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
Faster Algorithms for String Matching Problems: Matching the Convolution Bound.
Piotr Indyk
Venue
A*
FOCS
Year
1998
Proceedings
FOCS
DBLP record
conf/focs/Indyk98a ↗
Browse the full
FOCS paper archive
.