1. RPO Constraint Solving Is in NP;Computer Science Logic;1999
2. Termination proofs using gpo ordering constraints;TAPSOFT '97: Theory and Practice of Software Development;1997
3. Problems in rewriting III;Rewriting Techniques and Applications;1995
4. Complete axiomatizations of some quotient term algebras;Theoretical Computer Science;1993-09
5. A taste of rewrite systems;Functional Programming, Concurrency, Simulation and Automated Reasoning;1993