𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple real-time constant-space string matching

✍ Scribed by Breslauer, Dany; Grossi, Roberto; Mignosi, Filippo


Book ID
123231590
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
316 KB
Volume
483
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Constant-space string-matching in sublin
✍ 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

Constant-Time Randomized Parallel String
✍ Crochemore, Maxime; Galil, Zvi; Gasieniec, Leszek; Park, Kunsoo; Rytter, Wojciec πŸ“‚ Article πŸ“… 1997 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 280 KB
Time-space-optimal string matching
✍ Zvi Galil; Joel Seiferas πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 875 KB