Pages that link to "Item:Q4015971"
From MaRDI portal
The following pages link to A Lower Bound for Parallel String Matching (Q4015971):
Displaying 13 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Parallel two dimensional witness computation (Q1887160) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- On the lower bound for parallel string matching (Q4332447) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Optimal parallel algorithms for Prefix Matching (Q4632427) (← links)
- On the lower bound for parallel string matching (Q4844575) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
