Paulo D. Conejo

According to our database, Paulo D. Conejo authored at least 2 papers between 1998 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2003

A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees.

Mauricio Ayala-Rincón, Paulo D. Conejo

Algorithmica, 2003

1998

A Linear Time Lower Bound on Updating Algorithms for Suffix Trees.

Mauricio Ayala-Rincón, Paulo D. Conejo

Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998