Optimal parallel pattern matching in strings
From MaRDI portal
Publication:3716299
DOI10.1016/S0019-9958(85)80028-0zbMath0588.68023OpenAlexW4212840250WikidataQ56813861 ScholiaQ56813861MaRDI QIDQ3716299
Publication date: 1985
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(85)80028-0
parallel computationparallel linear algorithmconcurrent-read concurrent-write parallel random-access machine
Related Items (25)
An efficient parallel algorithm for the single function coarsest partition problem ⋮ On two-dimensional pattern matching by optimal parallel algorithms ⋮ Parallel two dimensional witness computation ⋮ Squares, cubes, and time-space efficient string searching ⋮ Finding all periods and initial palindromes of a string in parallel ⋮ Fast string matching with k differences ⋮ Sorting strings and constructing digital search trees in parallel ⋮ Matching patterns in strings subject to multi-linear transformations ⋮ On linear-time alphabet-independent 2-dimensional pattern matching ⋮ Inplace run-length 2d compressed search. ⋮ On the lower bound for parallel string matching ⋮ Towards optimal packed string matching ⋮ Parallel tree pattern matching ⋮ Efficient string matching on packed texts ⋮ Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays ⋮ Optimal two-dimensional compressed matching ⋮ Generalized function matching ⋮ Two-dimensional pattern matching by sampling ⋮ A string-matching algorithm for the CREW PRAM ⋮ Fast parallel and serial multidimensional approximate array matching ⋮ Optimal parallel algorithms for periods, palindromes and squares ⋮ Optimal parallel two dimensional text searching on a CREW PRAM ⋮ Alphabet-independent optimal parallel search for three-dimensional patterns ⋮ Optimal discovery of repetitions in 2D ⋮ Optimal Parallel Searching an Array for Certain Repetitions
This page was built for publication: Optimal parallel pattern matching in strings
