Author:
R. Arikati Srinivasa,Dessmark Anders,Lingas Andrzej,V. Marathe Madhav
Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. A. Amir, M. Farach, Efficient 2-dimensional approximate matching of non-rectangular figures, Proc. 2nd Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), 1992, pp. 212–223.
2. An alphabet-independent approach to two-dimensional matching;Amir;SIAM J. Comput.,1994
3. A technique for extending rapid exact-match string matching to arrays of more than one dimension;Baker;SIAM J. Comput.,1978
4. B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, 24th IEEE Symp. on Foundations of Computer Science (FOCS), 1983, pp. 265–273. (Journal version in J. ACM (41)(1) (1994) 153–180.)
5. A theory of parameterized pattern matching;Baker;J. Comput. System Sci.,1996