James F. Reid

According to our database, James F. Reid authored at least 5 papers between 1998 and 2001.

Collaborative distances:

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

2001

Sequential and parallel algorithms for decomposing partially occluded one and two-dimensional texts.

James F. Reid

PhD thesis, 2001

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem.

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón, James F. Reid

Inf. Process. Lett., 2001

Decomposition of Partially Occluded Strings in the Presence of Errors.

Costas S. Iliopoulos, James F. Reid

Int. J. Pattern Recognit. Artif. Intell., 2001

2000

Optimal parallel analysis and decomposition of partially occluded strings.

Costas S. Iliopoulos, James F. Reid

Parallel Comput., 2000

1998

Validating and Decomposing Partially Occluded Two-Dimensional Images (Extended Abstract).

Costas S. Iliopoulos, James F. Reid

Proceedings of the Prague Stringology Club Workshop 1998, Prague, Czech Republic, 1998