The following pages link to (Q3677695):
Displaying 12 items.
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Identifying periodic occurrences of a template with applications to protein structure (Q1209310) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Approximate matching in the \(L_{\infty }\) metric (Q2380061) (← links)
- \(L_{1}\) pattern matching lower bound (Q2380062) (← links)
- Guessing probability distributions from small samples (Q2500064) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- (Q4529547) (← links)
- (Q4681771) (← links)
- Two-dimensional pattern matching on a dynamic library of texts (Q6085750) (← links)
