𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constant-Time Randomized Parallel String Matching

✍ Scribed by Crochemore, Maxime; Galil, Zvi; Gasieniec, Leszek; Park, Kunsoo; Rytter, Wojciech

Book ID
118178161
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
280 KB
Volume
26
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constant-space string-matching in sublin
Constant-space string-matching in sublinear average time
✍ Maxime Crochemore; Leszek GaΜ§sieniec; Wojciech Rytter πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 462 KB

Given two strings: pattern P of length m and text T of length n. The string-matching problem is to find all occurrences of the pattern P in the text T. We present a string-matching algorithms which works in o(n) average time and constant additional space for one-dimensional texts and two-dimensional