Pages that link to "Item:Q3495651"
From MaRDI portal
The following pages link to An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm (Q3495651):
Displaying 16 items.
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- A string-matching algorithm for the CREW PRAM (Q688234) (← links)
- Optimal parallel two dimensional text searching on a CREW PRAM (Q1271473) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← 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)
- Optimal two-dimensional compressed matching (Q4632428) (← links)
- On the lower bound for parallel string matching (Q4844575) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
