On two-dimensional pattern matching by optimal parallel algorithms

DOI10.1016/0304-3975(94)00012-3MaRDI QIDQ1334677zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 4205980 (Why is no real title available?)
• scientific article; zbMATH DE number 3913712 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 3551946 (Why is no real title available?)
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• Fast parallel and serial multidimensional approximate array matching
• Optimal parallel algorithms for string matching
• Optimal parallel pattern matching in strings
• Parallel construction of a suffix tree with applications
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334677)