Parallel two dimensional witness computation
From MaRDI portal
Publication:1887160
DOI10.1016/S0890-5401(03)00162-7zbMath1078.68155OpenAlexW2013685635MaRDI QIDQ1887160
Publication date: 23 November 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00162-7
Cites Work
- Optimal parallel two dimensional text searching on a CREW PRAM
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- An O(n log n) algorithm for finding all repetitions in a string
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- Optimal parallel pattern matching in strings
- Relations between Concurrent-Write Models of Parallel Computation
- A Lower Bound for Parallel String Matching
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Constant-Time Randomized Parallel String Matching
- Two-Dimensional Periodicity in Rectangular Arrays
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
- The Parallel Simplicity of Compaction and Chaining
- Alphabet-Independent Two-Dimensional Witness Computation
- Parallel Suffix–Prefix-Matching Algorithm and Applications
- Optimal parallel algorithms for periods, palindromes and squares
This page was built for publication: Parallel two dimensional witness computation
