Pages that link to "Item:Q4376173"
From MaRDI portal
The following pages link to Constant-Time Randomized Parallel String Matching (Q4376173):
Displaying 12 items.
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Detecting false matches in string-matching algorithms (Q1361416) (← links)
- Parallel two dimensional witness computation (Q1887160) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Fast string matching in stationary ergodic sources (Q2785374) (← links)
- Efficient randomized pattern-matching algorithms (Q3799643) (← links)
- Faster Parallel String Matching via Larger Deterministic Samples (Q4285916) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- A constant-time optimal parallel string-matching algorithm (Q4369885) (← links)
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching (Q4388892) (← links)
- On the lower bound for parallel string matching (Q4844575) (← links)