Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CPM
/
Paper
Tight Comparison Bounds for the String Prefix-Matching Problem.
Dany Breslauer
,
Livio Colussi
,
Laura Toniolo
Venue
B
CPM
Year
1993
Proceedings
CPM
DBLP record
conf/cpm/BreslauerCT93 ↗
Browse the full
CPM paper archive
.