Constant-Time Randomized Parallel String Matching
From MaRDI portal
Recommendations
- A constant-time optimal parallel string-matching algorithm
- Parallel String Matching Algorithms
- scientific article; zbMATH DE number 826050
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- Optimal parallel algorithms for string matching
- scientific article; zbMATH DE number 3911754
- Optimal parallel pattern matching in strings
- scientific article; zbMATH DE number 710402
- Fast parallel and serial approximate string matching
Cited in
(14)- A Lower Bound for Parallel String Matching
- Fast string matching in stationary ergodic sources
- Parallel two dimensional witness computation
- scientific article; zbMATH DE number 826061 (Why is no real title available?)
- Faster Parallel String Matching via Larger Deterministic Samples
- A constant-time optimal parallel string-matching algorithm
- Boolean circuit programming: A new paradigm to design parallel algorithms
- Towards optimal packed string matching
- On the lower bound for parallel string matching
- Efficient CRCW-PRAM algorithms for universal substring searching
- Constant-time word-size string matching
- Efficient randomized pattern-matching algorithms
- Efficient string matching on packed texts
- String matching in O( n+ m) quantum time
This page was built for publication: Constant-Time Randomized Parallel String Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376173)
