Constant-time randomized parallel string matching

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 950-960

  Crochemore, Maxime ^a   Galil, Zvi ^b,c   Ga̧sieniec, Leszek ^d   Park, Kunsoo ^e   Rytter, Wojciech ^f,g  

^a Université de Marne la Vallée   (France)

^b Department of Earth and Environmental Sciences   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^e Seoul National University   (South Korea)

^f UNIVERSITY OF WARSAW   (Poland)

^g UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Deterministic samples; Parallel string matching; Randomized algorithms

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES;

PARALLEL STRING MATCHING; RANDOMIZED ALGORITHM;

PARALLEL ALGORITHMS;

EID: 0031211960     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979528007X     Document Type: Article

References (13)

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, Lecture Notes in Comput. Sci. 623, Springer-Verlag, Berlin, 1992, pp. 296-307.
2. D. BRESLAUER AND Z. GALIL, An optimal O(log log n) time parallel string matching algorithm, SIAM J. Comput., 19 (1990), pp. 1051-1058.
3. D. BRESLAUER AND Z. GALIL, A lower bound for parallel string matching, SIAM J. Comput. 21 (1992), pp. 856-862.
4. B. S. CHLEBUS AND L. GASIENIEC, Optimal pattern matching on meshes, in Proc. 11th Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, Berlin, 1994, pp. 213-224.
5. R. COLE, M. CROCHEMORE, Z. GALIL, L. GASIENIEC, R. HARIHARAN, S. MUTHUKRISHNAN, K. PARK, AND W. RYTTER, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, in Proc. 34th IEEE Symposium Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 248-258.
6. A. CZUMAJ, Z. GALIL, L. GASIENIEC, K. PARK, AND W. PLANDOWSKI, Work-time optimal parallel algorithms for string problems, in Proc. 27th ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 713-722.
7. F. E. FICH, P. RAGDE, AND A. WIGDERSON, Relations between concurrent-write models of parallel computation, SIAM J. Comput., 17 (1988), pp. 606-627.
8. Z. GALIL, A constant-time optimal parallel string-matching algorithm, J. Assoc. Comput. Mach., 42 (1995), pp. 908-918.
9. T. HAGERUP, On a compaction theorem of Ragde, Inform. Process. Lett., 43 (1992), pp. 335-340.
10. R. M. KARP AND M. O. RABIN, Efficient randomized pattern-matching algorithms, IBM J. Res. Develop., (1987), pp. 249-260.
11. P. RAGDE, The parallel simplicity of compaction and chaining, J. Algorithms, 14 (1993), pp. 371-380.
12. U. VISHKIN, Optimal parallel pattern matching in strings, Inform. and Control, 67 (1985), pp. 91-113.
13. U. VISHKIN, Deterministic sampling - a new technique for fast pattern matching, SIAM J. Comput., 20 (1991), pp. 22-40.