On two-dimensional pattern matching by optimal parallel algorithms

DOI10.1016/0304-3975(94)00012-3zbMath0938.68936OpenAlexW2002730083MaRDI QIDQ1334677

Maxime Crochemore, Wojciech Rytter

Publication date: 25 September 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00012-3

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Cites Work

• Parallel construction of a suffix tree with applications
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Fast parallel and serial multidimensional approximate array matching
• Optimal parallel algorithms for string matching
• Optimal parallel pattern matching in strings
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On two-dimensional pattern matching by optimal parallel algorithms