Author:
Ramesh R.,Ramakrishnan I. V.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. A.V. Aho and M.J. Corasick, “Efficient String Matching: An Aid to Bibliographic Search”, CACM, Vol 18 No. 6, June 1975, pp. 333–340.
2. C.M. Hoffmann and M.J. O'Donnell, “Pattern Matching in Trees”, JACM 29, 1, 1982 pp. 68–95.
3. D. E. Knuth and P. Bendix, “Simple word problems in Universal Algebras”, Computational Problems in Abstract Algebra, J. Leech, ed., Pergammon Press, Oxford 1970, pp. 263–297.
4. D.R. Chase, “An Improvement to Bottom-up Tree Pattern Matching”, Fourteenth Annual ACM Symposium on Principles of Programming Languages, Jan 1987.
5. M.J. O'Donnell, “Equational Logic as a Programming Language”, Foundations of Computation Series, MIT Press 1985.