A. A. Amir, G. Benson, and M. Farach, Alphabet independent two dimensional matching, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , STOC '92, pp.59-68, 1992.
DOI : 10.1145/129712.129719

A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

A. , A. Apostolico, and A. Ehrenfeucht, EEcient detection of quasiperiodicities in strings, Theoret. Comput. Sci, vol.119, pp.247-265, 1993.

A. A. Apostolico, M. Farach, and C. S. Iliopoulos, Optimal superprimitivity testing for strings, Optimal superprimitivity testing for strings, pp.17-20, 1991.
DOI : 10.1016/0020-0190(91)90056-N

A. M. Ben-amram, O. Berkman, C. S. Iliopoulos, and K. Park, The subtree max gap problem with application to parallel string covering, Proc. 5th ACM-SIAM Symp. Discrete Algorithms, pp.501-510, 1994.

]. D. Br92 and . Breslauer, An on-line string superprimitivity test, Inform. Process. Lett, vol.44, pp.345-347, 1992.

]. D. Br95 and . Breslauer, Testing string superprimitivity in parallel

B. , O. Berkman, and U. Vishkin, Finding level-ancestors in trees, Journal of computer and System Sciences, vol.48, pp.214-230, 1994.

D. , A. M. Duval, and W. F. Smyth, Covering a circular string with substrings of xed length, to appear in the Int, Journal of Foundations of Computer Science

H. , D. Harel, and &. R. Tarjan, Fast Algorithms for nding nearest common ancestors, SIAM J. Computing, pp.338-355, 1984.

L. Gasieniec and K. Park, Work-time optimal parallel preex matching, Proc 2nd European Symposium on Algorithms, 1994.
DOI : 10.1007/bfb0049432

R. Giancarlo, The suux tree of a square matrix, ACM-SIAM Proc. 4th Symposium on Discrete Algorithms, pp.402-411, 1993.

R. Giancarlo, A Generalization of the Suffix Tree to Square Matrices, with Applications, SIAM Journal on Computing, vol.24, issue.3, pp.520-562, 1995.
DOI : 10.1137/S0097539792231982

C. S. Iliopoulos and M. Korda, Optimal parallel superprimitivity testing for square arrays, to appear in Par, Proc. Letters

I. S. Iliopoulos and M. Korda, Parallel two dimensional covering, Proc. 7-th Australasian Workshop on Combinatorial Algorithms, pp.62-74, 1996.

C. S. Iliopoulos, D. W. Moore, and K. Park, Covering a string, Proc 4th Symp. Combinatorial Pattern Matching, pp.54-62, 1993.
DOI : 10.1007/BFb0029796

I. , C. S. Iliopoulos, and K. Park, An optimal O(log log n) time algorithm for parallel superprimitivity testing, Journal of the Korea Information Science Society, vol.21, issue.8, pp.1400-1404, 1994.

K. , D. E. Knuth, J. H. Morris, and V. R. Pratt, Fast pattern matching in strings, SIAM Journal of Computing, vol.6, pp.322-350, 1977.

M. , G. M. Main, and R. J. Lorentz, An O(n log n) algorithm for nding all repetitions in a string, Journal of Algorithms, vol.5, pp.422-432, 1984.

M. , D. W. Moore, and W. F. Smyth, Computing the covers of a string in linear time, Proc. 5th ACM-SIAM Symp. Discrete Algorithms, pp.511-515, 1994.

B. Scheiber and U. Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization, SIAM Journal on Computing, vol.17, issue.6, pp.1253-1262, 1988.
DOI : 10.1137/0217079