The following pages link to Juliusz Straszyński (Q782158):
Displaying 15 items.
- Efficient computation of sequence mappability (Q2134748) (← links)
- String covers of a tree (Q2146126) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- (Q5874434) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- Shortest covers of all cyclic shifts of a string (Q5896123) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Circular pattern matching with \(k\) mismatches (Q5919356) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- (Q6075975) (← links)
- Linear-time computation of shortest covers of all rotations of a string (Q6496851) (← links)
- Rectangular tile covers of 2D-strings (Q6496852) (← links)
- Weighted shortest common supersequence problem revisited (Q6536257) (← links)
