On maximal suffices and constant-space linear-time versions of KMP algorithm
From MaRDI portal
Recommendations
Cited in
(6)- Validating the Knuth-Morris-Pratt failure function, fast and online
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
- Simple real-time constant-space string matching
- A note on a simple computation of the maximal suffix of a string
- scientific article; zbMATH DE number 1256763 (Why is no real title available?)
- A grouping approach for succinct dynamic dictionary matching
This page was built for publication: On maximal suffices and constant-space linear-time versions of KMP algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044327)