Pages that link to "Item:Q674342"
From MaRDI portal
The following pages link to Fast parallel string prefix-matching (Q674342):
Displaying 6 items.
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Optimal parallel algorithms for Prefix Matching (Q4632427) (← links)
- Fast prefix matching of bounded strings (Q5463440) (← links)