A lower bound for parallel string matching
Author:
Breslauer Dany,Galil Zvi
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. String Matching with Wildcards in the Massively Parallel Computation Model;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06
2. Unit route upper bound for string-matching on hypercube;Combinatorial Pattern Matching;1994
3. Structural parallel algorithmics;Automata, Languages and Programming;1991
4. Detecting false matches in string matching algorithms;Combinatorial Pattern Matching