Pages that link to "Item:Q4369885"
From MaRDI portal
The following pages link to A constant-time optimal parallel string-matching algorithm (Q4369885):
Displaying 11 items.
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm (Q3495651) (← links)
- A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches (Q3558261) (← links)
- (Q4234122) (← links)
- Constant-Time Randomized Parallel String Matching (Q4376173) (← links)
- On the lower bound for parallel string matching (Q4844575) (← links)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
- Parallel String Matching (Q5862565) (← links)