%0 Conference Paper %1 conf/spire/Ayala-RincconC98 %A Ayala-Rincón, Mauricio %A Conejo, Paulo D. %B SPIRE %D 1998 %I IEEE Computer Society %K %P 1-6 %T A Linear Time Lower Bound on Updating Algorithms for Suffix Trees. %U http://dblp.uni-trier.de/db/conf/spire/spire98.html#Ayala-RincconC98 %@ 0-8186-8664-2

@inproceedings{conf/spire/Ayala-RincconC98, added-at = {2023-12-12T18:50:27.000+0100}, author = {Ayala-Rincón, Mauricio and Conejo, Paulo D.}, biburl = {https://www.bibsonomy.org/bibtex/2c3764f5338233f2bcc67689cb072f493/admin}, booktitle = {SPIRE}, crossref = {conf/spire/1998}, ee = {http://doi.ieeecomputersociety.org/10.1109/SPIRE.1998.712976}, interhash = {17fdc664cce0285e81d25769a29675d9}, intrahash = {c3764f5338233f2bcc67689cb072f493}, isbn = {0-8186-8664-2}, keywords = {}, pages = {1-6}, publisher = {IEEE Computer Society}, timestamp = {2023-12-12T18:50:27.000+0100}, title = {A Linear Time Lower Bound on Updating Algorithms for Suffix Trees.}, url = {http://dblp.uni-trier.de/db/conf/spire/spire98.html#Ayala-RincconC98}, year = 1998 }