Author:
Breslauer D.,Gasieniec Leszek
Subject
Computer Science Applications,General Mathematics,Software
Reference40 articles.
1. 1. AMIR C., BENSON G. and FARACH M., An alphabet-independent approach to two-dimensional pattern-matching, SIAM J. Comput., 1994, 23 (2), pp. 313-323.12672120804.68056
2. 2. APOSTOLICO A., On context constrained squares and repetitions in a string, RAIRO Informatique théorique, 1984, 18 (2), pp. 147-159.922037615140543.68067
3. 3. APOSTOLICO A., Optimal parallel detection of squares in strings, Algorithmica, 1992, 8, pp. 285-319.11869000748.68022
4. 4. APOSTOLICO A. and BRESLAUER D., An optimal O (log log n) time parallel algorithm for detecting all squares in a string, SIAM J. Comput., to appear.14179020864.68045
5. 5. APOSTOLICO A., BRESLAUER D. and GALIL Z., Optimal parallel algorithms for periods, palindromes and squares. In Proc. 19th International Colloquium on Automata, Languages, and Programming, number 623 in Lecture Notes in Computer Science, pages 206-307. Springer-Verlag, Berlin, Germany, 1992.