Author:
Arikati Srinivasa R.,Dessmark Anders,Lingas Andrzej,Marathe Madhav
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. A. Amir, and M. Farach, “Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures,” Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1992, pp. 212–223.
2. A. Amir, G. Benson, G. Benson and M. Farach. An Alphabet-independent Approach to Two-Dimensional Matching. Proc. 24th ACM Symposium on Theory of Computing, 1992, pp. 59–68. Journal version to appear in SIAM J. Computing.
3. T. P. Baker. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Computing, No. 7, 1978, pp. 533–541.
4. B.S. Baker. “Approximation Algorithms for NP-complete Problems on Planar Graphs,” 24th IEEE Symposium on Foundations of Computer Science (FOCS), 1983, pp 265–273. (Journal version in J. ACM, Vol. 41, No. 1, 1994, pp. 153–180.)
5. B. Baker, “A Theory of Parameterized Pattern Matching: Algorithms and Applications,” Proc. 25th ACM Symposium on Theory of Computing, 1993, pp. 71–80. Journal version to appear in Journal of Computer and System Sciences (JCSS).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献