Complexity of matching problems-Reference-Cited by-同舟云学术

Complexity of matching problems

Author:

Benanav Dan,Kapur Deepak,Narendran Paliath

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference21 articles.

1. Complexity of Matching Problems;Benanav,1985

2. Parallel Algorithms for Term Matching;Dwork,1986

3. Computers and Intractability;Garey,1979

4. Pattern Matching in Trees;Hoffman;Journal of Assoc, of Comp. Mach.,1982

5. Associative-Commutative Pattern Matching;Hullot,,1979

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

1. Automatic Generation of Vectorizing Compilers for Customizable Digital Signal Processors;Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1;2024-04-17

3. DNNFusion: accelerating deep neural networks execution with advanced operator fusion;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18

5. Vectorization for digital signal processors via equality saturation;Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems;2021-04-17