![]() |
| 2003 | ||
|---|---|---|
| 2 | EE | 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) |
| 1998 | ||
| 1 | Mauricio Ayala-Rincón, Paulo D. Conejo: A Linear Time Lower Bound on Updating Algorithms for Suffix Trees. SPIRE 1998: 1-6 | |
| 1 | Mauricio Ayala-Rincón | [1] [2] |