The following pages link to Jakub Radoszewski (Q313970):
Displaying 7 items.
- Order-preserving indexing (Q294954) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- String powers in trees (Q1679231) (← links)
- Longest palindromic substring in sublinear time (Q6496849) (← links)
- Linear-time computation of shortest covers of all rotations of a string (Q6496851) (← links)
- Rectangular tile covers of 2D-strings (Q6496852) (← links)