Complexity of matching problems

Matching, unification and complexity

ACM SIGSAM Bulletin

Complexity of matching problems

Journal of Symbolic Computation

Adventures in associative-commutative unification

Journal of Symbolic Computation

Using types as search keys in function libraries

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture

Complexity of Makanin's algorithm

Journal of the ACM (JACM)

Compiling language definitions: the ASF+SDF compiler

ACM Transactions on Programming Languages and Systems (TOPLAS)

Eliminating unorthodox derivation rules in an axiom system for iteration-free P D L with intersection

Fundamenta Informaticae

Multitree automata that count

Theoretical Computer Science - Foundations of software science and computation structures

Counting and equality constraints for multitree automata

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software

Unification and matching on compressed terms

ACM Transactions on Computational Logic (TOCL)

Eliminating Unorthodox Derivation Rules in an Axiom System for Iteration-free PDL with Intersection

Fundamenta Informaticae

Foundations of rule-based query answering

RW'07 Proceedings of the Third international summer school conference on Reasoning Web