Pages that link to "Item:Q1190451"
From MaRDI portal
The following pages link to String-matching on ordered alphabets (Q1190451):
Displaying 14 items.
- Simple real-time constant-space string matching (Q390869) (← links)
- A note on a simple computation of the maximal suffix of a string (Q396649) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- On maximal suffixes and constant-space linear-time versions of KMP algorithm. (Q1874422) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- String matching with simple devices (Q2380036) (← links)
- Simple Real-Time Constant-Space String Matching (Q3011852) (← links)
- Non-Overlapping Indexing - Cache Obliviously (Q5140770) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Non-overlapping indexing in BWT-runs bounded space (Q6545434) (← links)
- Efficient parameterized pattern matching in sublinear space (Q6545436) (← links)
