Optimal Parallel Algorithms for String Matching - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Zvi Galil. Optimal Parallel Algorithms for String Matching. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, 1984, Washington, D.C., USA. pages 240-248, ACM, 1984.

The following publications are possibly variants of this publication:

Optimal Parallel Algorithms for String MatchingZvi Galil. iandc, 67(1-3):144-157, October/November/December 1985.

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensionsRichard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter. focs 1993: 248-258

A Constant-Time Optimal Parallel String-Matching AlgorithmZvi Galil. stoc 1992: 69-76

A Constant-Time Optimal Parallel String-Matching AlgorithmZvi Galil. JACM, 42(4):908-918, 1995. [doi]

runs on WebDSL