Author:
Mráz František,Průša Daniel,Wehar Michael
Publisher
Springer International Publishing
Reference23 articles.
1. Abboud, A., Backurs, A., Williams, V.V.: If the current clique algorithms are optimal, so is Valiant’s parser. In: Guruswami, V. (ed.) FOCS 2015, pp. 98–117. IEEE Computer Society (2015).
https://doi.org/10.1109/FOCS.2015.16
2. Aho, A.V.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Algorithms and Complexity, Handbook of Theoretical Computer Science, vol. A, pp. 255–300. The MIT Press, Cambridge (1990)
3. Lecture Notes in Computer Science;M Anselmo,2007
4. Baeza-Yates, R., Régnier, M.: Fast two-dimensional pattern matching. Inf. Process. Lett. 45(1), 51–57 (1993).
https://doi.org/10.1016/0020-0190(93)90250-D
5. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: SWAT 1967, pp. 155–160. IEEE Computer Society (1967).
https://doi.org/10.1109/FOCS.1967.6
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献