| 2020 | LATA | Complexity of Automatic Sequences. | Hans Zantema |
| 2017 | DLT | DFAs and PFAs with Long Shortest Synchronizing Word Length. | Michiel de Bondt, Henk Don, Hans Zantema |
| 2017 | DLT | Classifying Non-periodic Sequences by Permutation Transducers. | Hans Zantema, Wieb Bosma |
| 2017 | LATA | Finding DFAs with Maximal Shortest Synchronizing Word Length. | Henk Don, Hans Zantema |
| 2015 | ATVA | Using SMT for Solving Fragments of Parameterised Boolean Equation Systems. | Ruud P. J. Koolen, Tim A. C. Willemse, Hans Zantema |
| 2010 | LATA | Complexity of Guided Insertion-Deletion in RNA-Editing. | Hans Zantema |
| 2009 | CALCO | A Tool Proving Well-Definedness of Streams Using Termination Tools. | Hans Zantema |
| 2009 | CSL | Degrees of Undecidability in Term Rewriting. | Jrg Endrullis, Herman Geuvers, Hans Zantema |
| 2009 | FMICS | Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models. | Matthias Raffelsieper, Mohammad Reza Mousavi, Jan-Willem Roorda, Chris W. H. Strolenberg, Hans Zantema |
| 2008 | SOFSEM | Certification of Proving Termination of Term Rewriting by Matrix Interpretations. | Adam Koprowski, Hans Zantema |
| 2006 | CADE | Matrix Interpretations for Proving Termination of Term Rewriting. | Jrg Endrullis, Johannes Waldmann, Hans Zantema |
| 2006 | CADE | Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. | Adam Koprowski, Hans Zantema |
| 2004 | LATIN | A Proof System and a Decision Procedure for Equality Logic. | Olga Tveretina, Hans Zantema |
| 2000 | MFCS | Binary Decision Diagrams by Shard Rewriting. | Jaco van de Pol, Hans Zantema |
| 1996 | CADE | Transforming Termination by Self-Labelling. | Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema |
| 1996 | CSL | Relative Undecidability in Term Rewriting. | Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema |
| 1995 | FCT | Dummy Elimination: Making Termination Easier. | Maria C. F. Ferreira, Hans Zantema |
| 1995 | LOPSTR | Termination of Logic Programs Using Semantic Unification. | Thomas Arts, Hans Zantema |
| 1994 | CADE | Simple Termination Revisited. | Aart Middeldorp, Hans Zantema |