Pages that link to "Item:Q4285916"
From MaRDI portal
The following pages link to Faster Parallel String Matching via Larger Deterministic Samples (Q4285916):
Displaying 8 items.
- Derivation of a parallel string matching algorithm (Q1007539) (← links)
- String search in coarse-grained parallel computers (Q1125800) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Deterministic Sampling–A New Technique for Fast Pattern Matching (Q3204065) (← links)
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm (Q3495651) (← links)
- Parallel String Matching Algorithms (Q3814826) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Simple Optimal Parallel Multiple Pattern Matching (Q4943067) (← links)