![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 14 | Mauricio Ayala-Rincón, Paulo D. Conejo: A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees. Algorithmica 37(3): 233-241 (2003) | |
| 2 | Mauricio Ayala-Rincón, Paulo D. Conejo: A Linear Time Lower Bound on Updating Algorithms for Suffix Trees. SPIRE 1998: 1-6 |
Selection of 2 from 56 records - Mauricio Ayala-Rincón has 37 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page