1. A. Apostolico and D. Breslauer. An optimalO(log logn) time parallel algorithm for detecting all squares in a string.SIAM J. Comput., to appear.
2. Lecture Notes in Computer Science, Vol. 623;A. Apostolico,1992
3. H. W. Bergerson.Palindromes and Anagrams. Dover. New York, 1973.
4. R. P. Brent. Evaluation of general arithmetic expressions.J. Assoc. Comput. Mach., 21:201?206, 1974.
5. D. Breslauer. Efficient String Algorithmics. Ph.D. thesis, Department of Computer Science, Columbia University, New York, 1992.