Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm.
Richard Cole
Venue
A*
SODA
Year
1991
Proceedings
SODA
DBLP record
conf/soda/Cole91 ↗
Browse the full
SODA paper archive
.