Pages that link to "Item:Q671438"
From MaRDI portal
The following pages link to A work-time optimal algorithm for computing all string covers (Q671438):
Displaying 13 items.
- Enhanced string covering (Q393116) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Optimal superprimitivity testing for strings (Q811134) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- An optimal algorithm to compute all the covers of a string (Q1329417) (← links)
- String covering with optimal covers (Q1757464) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Computing the \(\lambda \)-covers of a string (Q2384518) (← links)
- The subtree max gap problem with application to parallel string covering (Q2508342) (← links)
- Fast Algorithm for Partial Covers in Words (Q4928571) (← links)
- Generalized approximate regularities in strings (Q5451457) (← links)
- Approximate periods of strings (Q5958136) (← links)
- String Covering: A Survey (Q6145625) (← links)