Simple deterministic wildcard matching-Reference-Cited by-同舟云学术

Simple deterministic wildcard matching

Published:2007-01 Issue:2 Volume:101 Page:53-54
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Clifford Peter,Clifford Raphaël

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference4 articles.

1. R. Cole, R. Hariharan, Verifying candidate matches in sparse and wildcard matching, in: Proceedings of the Annual ACM Symposium on Theory of Computing, 2002, pp. 592–601

2. M. Fischer, M. Paterson, String matching and other products, in: R. Karp (Ed.), Proceedings of the 7th SIAM–AMS Complexity of Computation, 1974, pp. 113–125

3. P. Indyk, Faster algorithms for string matching problems: Matching the convolution bound, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1998, pp. 166–173

4. Efficient pattern-matching with don't cares;Kalai,2002

Cited by 54 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Faster FFT-based Wildcard Pattern Matching;Companion of the 2023 International Conference on Management of Data;2023-06-04

2. Combinatorial Algorithms for Subsequence Matching: A Survey;Electronic Proceedings in Theoretical Computer Science;2022-08-27

3. On the average-case complexity of pattern matching with wildcards;Theoretical Computer Science;2022-06

4. Elastic-Degenerate String Matching via Fast Matrix Multiplication;SIAM Journal on Computing;2022-05-19

5. Speedup of discrete Fourier transform by efficient modular arithmetic;Concurrency and Computation: Practice and Experience;2021-09-15