BibTeX record conf/spire/Ayala-RincconC98

download as .bib file

@inproceedings{DBLP:conf/spire/Ayala-RincconC98,
  author    = {Mauricio Ayala{-}Rinc{\'{o}}n and
               Paulo D. Conejo},
  title     = {A Linear Time Lower Bound on Updating Algorithms for Suffix Trees},
  booktitle = {String Processing and Information Retrieval: {A} South American Symposium,
               {SPIRE} 1998, Santa Cruz de la Sierra Bolivia, September 9-11, 1998},
  pages     = {1--6},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {https://doi.org/10.1109/SPIRE.1998.712976},
  doi       = {10.1109/SPIRE.1998.712976},
  timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
  biburl    = {https://dblp.org/rec/conf/spire/Ayala-RincconC98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.