𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Lower Bound for Parallel String Matching

✍ Scribed by Breslauer, Dany; Galil, Zvi

Book ID
118177286
Publisher
Society for Industrial and Applied Mathematics
Year
1992
Tongue
English
Weight
907 KB
Volume
21
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Derivation of a parallel string matching
Derivation of a parallel string matching algorithm
✍ Jayadev Misra πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 67 KB

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths.

Constant-Time Randomized Parallel String
Constant-Time Randomized Parallel String Matching
✍ Crochemore, Maxime; Galil, Zvi; Gasieniec, Leszek; Park, Kunsoo; Rytter, Wojciec πŸ“‚ Article πŸ“… 1997 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 280 KB