The Pseudo-Period Technique in Parallel String Matching
Download:
|
|
unknown authors
http://www.csc.liv.ac.uk/~leszek/papers/main.ps.gz
Add To MetaCart
Abstract:
We present improvements of known super fast parallel string matching algorithms. We introduce a new approach to parallel string matching called the pseudo-period technique. It is efficient for a various parallel models of computation. In the sense of work (total number of operations) all presented algorithms are optimal. They also achieve lower bounds for all
Citations
| 1206 | Introduction to Parallel Algorithms and Architectures: Arrays – Leighton - 1992 |
| 83 | An optimal sorting algorithm for mesh connected computers – Schnorr, Shamir - 1986 |
| 74 | Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network – Nassimi, Sahni - 1982 |
| 60 | Equations in free groups – Lyndon - 1960 |
| 34 | A 2n \Gamma 2 step algorithm for routing in an n \Theta n array with constant size queues – Leighton, Makedon, et al. - 1989 |
| 33 | Mesh computer algorithms for computational geometry – Miller, Stout - 1989 |
| 28 | Finding connected components and connected ones on a mesh-connected parallel computer – Nassimi, Sahni - 1980 |
| 22 | New parallel-sorting schemes – Preparata - 1978 |
| 1 | Optimal parallel matching – Vishkin - 1985 |
