| Termination of term rewriting by semantic labelling H Zantema Fundamenta Informaticae 24 (1-2), 89-105, 1995 | 260 | 1995 |
| Termination of term rewriting: interpretation and type elimination H Zantema Journal of Symbolic Computation 17 (1), 23-50, 1994 | 248 | 1994 |
| Matrix interpretations for proving termination of term rewriting J Endrullis, J Waldmann, H Zantema Journal of Automated Reasoning 40, 195-220, 2008 | 207 | 2008 |
| Basic process algebra with iteration: Completeness of its equational axioms W Fokkink, H Zantema The Computer Journal 37 (4), 259-267, 1994 | 97 | 1994 |
| Finding Small Equivalent Decision Trees is Hard. H Zantema, HL Bodlaender, F Preparata International Journal of Foundations of Computer Science 11 (2), 2000 | 93 | 2000 |
| Termination H Zantema Term Rewriting Systems, 181-259, 2003 | 83 | 2003 |
| Termination of context-sensitive rewriting H Zantema Rewriting Techniques and Applications: 8th International Conference, RTA-97 …, 1997 | 81 | 1997 |
| Simple termination of rewrite systems A Middeldorp, H Zantema Theoretical Computer Science 175 (1), 127-158, 1997 | 79 | 1997 |
| Integer valued polynomials over a number field H Zantema manuscripta mathematica 40, 155-203, 1982 | 79 | 1982 |
| Termination of string rewriting proved automatically H Zantema Journal of Automated Reasoning 34, 105-139, 2005 | 65 | 2005 |
| On tree automata that certify termination of left-linear term rewriting systems A Geser, D Hofbauer, J Waldmann, H Zantema Information and Computation 205 (4), 512-534, 2007 | 61 | 2007 |
| Resolution and binary decision diagrams cannot simulate each other polynomially JF Groote, H Zantema Discrete Applied Mathematics 130 (2), 157-171, 2003 | 59 | 2003 |
| The termination competition C Marché, H Zantema International Conference on Rewriting Techniques and Applications, 303-313, 2007 | 57 | 2007 |
| Transforming termination by self-labelling A Middeldorp, H Ohsaki, H Zantema Automated Deduction—Cade-13: 13th International Conference on Automated …, 1996 | 54 | 1996 |
| Dummy elimination: making termination easier MCF Ferreira, H Zantema Fundamentals of Computation Theory: 10th International Conference, FCT'95 …, 1995 | 54 | 1995 |
| Termination of logic programs using semantic unification T Arts, H Zantema International Workshop on Logic Programming Synthesis and Transformation …, 1995 | 52 | 1995 |
| Matrix interpretations for proving termination of term rewriting J Endrullis, J Waldmann, H Zantema Automated Reasoning: Third International Joint Conference, IJCAR 2006 …, 2006 | 50 | 2006 |
| Termination of term rewriting by interpretation H Zantema International Workshop on Conditional Term Rewriting Systems, 155-167, 1992 | 47 | 1992 |
| Well-foundedness of term orderings MCF Ferreira, H Zantema Conditional and Typed Rewriting Systems: 4th International Workshop, CTRS-94 …, 1995 | 44 | 1995 |
| Cinderella versus the wicked stepmother MHL Bodlaender, CAJ Hurkens, VJJ Kusters, F Staals, GJ Woeginger, ... Theoretical Computer Science: 7th IFIP TC 1/WG 2.2 International Conference …, 2012 | 41 | 2012 |
