Alphabet-independent optimal parallel search for three-dimensional patterns

DOI10.1016/S0304-3975(97)00252-1zbMath0913.68049MaRDI QIDQ1275083

Wojciech Rytter, Marek Karpinski

Publication date: 12 January 1999

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

Mathematics Subject Classification ID

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

Cites Work

• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Optimal parallel algorithms for string matching
• Optimal parallel pattern matching in strings
• Efficient randomized pattern-matching algorithms
• An efficient parallel algorithm for the row minima of a totally monotone matrix
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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