Pages that link to "Item:Q1183603"
From MaRDI portal
The following pages link to Optimal canonization of all substrings of a string (Q1183603):
Displaying 10 items.
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- A faster quick search algorithm (Q1736618) (← links)
- Lyndon-like and V-order factorizations of strings (Q1827280) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Constrained tree inclusion (Q2569419) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- Indexing Circular Patterns (Q5452151) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
