Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SPIRE
/
Paper
A Linear Time Lower Bound on Updating Algorithms for Suffix Trees.
Mauricio Ayala-Rincn
,
Paulo D. Conejo
Venue
C
SPIRE
Year
1998
Proceedings
SPIRE
DBLP record
conf/spire/Ayala-RincconC98 ↗
Browse the full
SPIRE paper archive
.