Advertisement

Fast many-to-one matching algorithms

  • Paul Walton PurdomJr.
  • Cynthia A. Brown
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 202)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [HOD82]
    Christoph M. Hoffmann and Michael J. O'Donnell, Pattern Matching in Trees, JACM 29 (1982) pp. 68–95.Google Scholar
  2. [KB70]
    Donald E. Knuth and Peter B. Bendix, Simple Word Problems in Universal Algebras, in Computational Problems in Universal Algebra (edited by John Leech), Pergamon (1970) pp. 263–297.Google Scholar
  3. [Kn84]
    Donald E. Knuth, Literate Programming, The Computer Journal 27 (1984) pp 97–111.Google Scholar
  4. [St81]
    Mark E. Stickel, A Unification Algorithm for Associative-Commutative Functions, J. ACM 28 (1981) pp 423–434.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Paul Walton PurdomJr.
    • 1
  • Cynthia A. Brown
    • 2
  1. 1.Indiana UniversityBloomington
  2. 2.Northeastern UniversityBoston

Personalised recommendations