Pages that link to "Item:Q1678758"
From MaRDI portal
The following pages link to Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758):
Displaying 10 items.
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- On Maximal Unbordered Factors (Q2942272) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- Reconstructing parameterized strings from parameterized suffix and LCP arrays (Q6199197) (← links)
