1. A. Apostolico, D. Breslauer, and Z. Galil. Optimal Parallel Algorithms for Periods, Palindromes and Squares. In Proc. 19th International Colloquium on Automata, Languages, and Programming, pages 296–307. Springer-Verlag, Berlin, Germany, 1992.
2. V.L. Arlazarov, E.A. Dinic, M.A. Kronrod, and I.A. Faradzev. On economic construction of the transitive closure of a directed graph. Soviet Math. Dokl., 11:1209–1210, 1970.
3. R.P. Brent. Evaluation of general arithmetic expressions. J. Assoc. Comput. Mach., 21:201–206, 1974.
4. D. Breslauer and Z. Galil. An optimal O(loglog n) time parallel string matching algorithm. SIAM J. Comput., 19(6):1051–1058, 1990.
5. D. Breslauer and Z. Galil. Finding all Periods and Initial Palindromes of a String in Parallel. Technical Report CUCS-017-92, Computer Science Dept., Columbia University, 1992.