Alphabet-independent optimal parallel search for three-dimensional patterns

DOI10.1016/S0304-3975(97)00252-1MaRDI QIDQ1275083zbMATH OpenFDO

Authors Marek Karpinski, Wojciech Rytter

Publication date 12 January 1999

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

Full work available at URL https://doi.org/10.1016/S0304-3975(97)00252-1

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Optimal parallel two dimensional text searching on a CREW PRAM
• Three-Dimensional Periodicity and Its Application to Pattern Matching
• scientific article; zbMATH DE number 826061

Cites work

• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• An efficient parallel algorithm for the row minima of a totally monotone matrix
• Efficient randomized pattern-matching algorithms
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 3551946 (Why is no real title available?)
• scientific article; zbMATH DE number 1256660 (Why is no real title available?)
• scientific article; zbMATH DE number 742992 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• Optimal parallel algorithms for string matching
• Optimal parallel pattern matching in strings
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays

Cited in

(2)

• Algorithms for three-dimensional dominance searching in linear space.
• Three-Dimensional Periodicity and Its Application to Pattern Matching

This page was built for publication: Alphabet-independent optimal parallel search for three-dimensional patterns

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