Pages that link to "Item:Q3204065"
From MaRDI portal
The following pages link to Deterministic Sampling–A New Technique for Fast Pattern Matching (Q3204065):
Displaying 15 items.
- Permuted scaled matching (Q294926) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- A string-matching algorithm for the CREW PRAM (Q688234) (← links)
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time (Q876699) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- New algorithms for the LCA problem and the binary tree reconstruction problem (Q1328757) (← links)
- Designing algorithms by expectations (Q1328761) (← links)
- Faster broadcasting in unknown radio networks (Q1603436) (← links)
- Parallel two dimensional witness computation (Q1887160) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- On Efficient Gossiping in Radio Networks (Q3408156) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
