Pages that link to "Item:Q3618600"
From MaRDI portal
The following pages link to Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600):
Displayed 11 items.
- The structural border array (Q396695) (← links)
- Indeterminate string inference algorithms (Q414420) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Compressed parameterized pattern matching (Q897868) (← links)
- Combinatorics on partial word borders (Q897922) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)