Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IDEAS
/
Paper
Prefix Trees: New Efficient Data Structures for Matching Strings of Different Lengths.
Nasser Yazdani
,
Paul S. Min
Venue
C
IDEAS
Year
2001
Proceedings
IDEAS
DBLP record
conf/ideas/YazdaniM01 ↗
Browse the full
IDEAS paper archive
.