Pages that link to "Item:Q650937"
From MaRDI portal
The following pages link to Verifying and enumerating parameterized border arrays (Q650937):
Displaying 9 items.
- 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)
- String inference from longest-common-prefix array (Q2110373) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
