On two-dimensional pattern matching by optimal parallel algorithms. (English) Zbl 0938.68936
References:
| [1] | Amir, A.; Landau, G.: Fast parallel and serial multidimensional approximate pattern matching. Theoret. comput. Sci. 81, 97-115 (1991) · Zbl 0725.68050 |
| [2] | Apostolico, A.; Ilipoulos, C.; Landau, G.; Schieber, B.; Vishkin, U.: Parallel construction of a suffix tree with applications. Algorithmica 3, 347-365 (1988) · Zbl 0646.68080 |
| [3] | Baker, T.: A technique for extending rapid exact string matching to arrays of more than one dimension. SIAM J. Comput. 7, 533-541 (1978) · Zbl 0387.68031 |
| [4] | Bird, R.S.: Two-dimensional pattern-matching. Inform. process. Lett. 6, 168-170 (1977) |
| [5] | Crochemore, M.; Rytter, W.: Parallel computations on strings and arrays. Stacs ’90 415, 109-125 (1990) · Zbl 0729.68024 |
| [6] | Crochemore, M.; Rytter, W.: Usefulness of the karp–Miller–rosenberg algorithm in parallel computations on strings and arrays. Theoret. comput. Sci. 88, 59-82 (1991) · Zbl 0737.68037 |
| [7] | Galil, Z.: Optimal parallel algorithm for string-matching. Inform. and control 67, 144-157 (1985) · Zbl 0588.68022 |
| [8] | Gibbons, A.; Rytter, W.: Efficient parallel algorithms. (1988) · Zbl 0771.68015 |
| [9] | Karp, R.; Miller, R.; Rosenberg, A.: Rapid identification of repeated patterns in strings, arrays and trees. Proc. 4th ACM symp. On theory of computation, 125-136 (1972) · Zbl 0354.68119 |
| [10] | Kedem, Z.; Landau, G.; Palem, K.: Optimal parallel suffix–prefix matching algorithm and its applications. Proc. 6th ACM symp. On parallel algorithms and architectures, 388-398 (1989) |
| [11] | Main, M.G.; Lorentz, R.J.: Linear-time recognition of square-free strings. Combinatorial algorithms on words 12, 271-278 (1985) · Zbl 0572.68068 |
| [12] | Vishkin, U.: Optimal parallel pattern matching in strings. Inform. and control 67, 91-113 (1985) · Zbl 0588.68023 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
