Author:
Neou Both Emerite,Rizzi Romeo,Vialette Stéphane
Publisher
Springer International Publishing
Reference16 articles.
1. Ahal, S., Rabinovich, Y.: On complexity of the subpattern problem. SIAM J. Discrete Math. 22(2), 629–649 (2008)
2. Lecture Notes in Computer Science;MH Albert,2001
3. Avis, D., Newborn, M.: On pop-stacks in series. Utilitas Math. 19, 129–140 (1981)
4. Bille, P., Gørtz, I.L.: The tree inclusion problem: in linear space and faster. ACM Trans. Algorithms 7(3), 38 (2011)
5. Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inf. Process. Lett. 65(5), 277–283 (1998)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献