Pages that link to "Item:Q3011852"
From MaRDI portal
The following pages link to Simple Real-Time Constant-Space String Matching (Q3011852):
Displaying 11 items.
- Finding the leftmost critical factorization on unordered alphabet (Q290524) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Online Detection of Repetitions with Backtracking (Q2942265) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet (Q5111729) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)