Normalization of S-Terms is Decidable. - Johannes Waldmann (RTA, 1998)

The combinator S. - Johannes Waldmann (1998)

The Combinator S. - Johannes Waldmann (Inf. Comput., 2000)

Some Regular Languages That Are Church-Rosser Congruential. - Gundula Niemann; Johannes Waldmann (Developments in Language Theory, 2001)

Rewrite Games. - Johannes Waldmann (RTA, 2002)

Matchbox: A Tool for Match-Bounded String Rewriting. - Johannes Waldmann (RTA, 2004)

Finding Finite Automata That Certify Termination of String Rewriting. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (CIAA, 2004)

Match-Bounded String Rewriting Systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (Appl. Algebra Eng. Commun. Comput., 2004)

Deleting string rewriting systems preserve regularity. - Dieter Hofbauer; Johannes Waldmann (Theor. Comput. Sci., 2004)

Finding finite automata that certify termination of string rewriting systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (Int. J. Found. Comput. Sci., 2005)

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (J. Autom. Reason., 2005)

Termination of String Rewriting with Matrix Interpretations. - Dieter Hofbauer; Johannes Waldmann (RTA, 2006)

Termination of {aa->bc, bb->ac, cc->ab}. - Dieter Hofbauer; Johannes Waldmann (Inf. Process. Lett., 2006)

Termination by Quasi-periodic Interpretations. - Hans Zantema; Johannes Waldmann (RTA, 2007)

On tree automata that certify termination of left-linear term rewriting systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (Inf. Comput., 2007)

Weighted Automata for Proving Termination of String Rewriting. - Johannes Waldmann (J. Autom. Lang. Comb., 2007)

Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. - Georg Moser; Andreas Schnabl; Johannes Waldmann (FSTTCS, 2008)

Arctic Termination ...Below Zero. - Adam Koprowski; Johannes Waldmann (RTA, 2008)

Matrix Interpretations for Proving Termination of Term Rewriting. - Jörg Endrullis; Johannes Waldmann; Hans Zantema (J. Autom. Reason., 2008)

Local Termination. - Jörg Endrullis; Roel C. de Vrijer; Johannes Waldmann (RTA, 2009)

Automatic Termination. - Johannes Waldmann (RTA, 2009)

Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems. - Andreas Gebhardt 001; Johannes Waldmann (Acta Cybern., 2009)

Max/Plus Tree Automata for Termination of Term Rewriting. - Adam Koprowski; Johannes Waldmann (Acta Cybern., 2009)

Polynomially Bounded Matrix Interpretations. - Johannes Waldmann (RTA, 2010)

Local Termination: theory and practice - Jörg Endrullis; Roel C. de Vrijer; Johannes Waldmann (Log. Methods Comput. Sci., 2010)

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. - Aart Middeldorp; Georg Moser; Friedrich Neurauter; Johannes Waldmann; Harald Zankl (CAI, 2011)

Exotic Semi-Ring Constraints. - Michael Codish; Yoav Fekete; Carsten Fuhs; Jürgen Giesl; Johannes Waldmann (SMT@IJCAR, 2012)

Propositional Encoding of Constraints over Tree-Shaped Data. - Alexander Bau; Johannes Waldmann (KDPD, 2013)

Compression of Rewriting Systems for Termination Analysis. - Alexander Bau; Markus Lohrey; Eric Nöth; Johannes Waldmann (RTA, 2013)

Describing and Measuring the Complexity of SAT encodings for Constraint Programs. - Alexander Bau; Johannes Waldmann (WLP/WFLP, 2014)

Automated Exercises for Constraint Programming. - Johannes Waldmann (WLP/WFLP, 2014)

Termination Competition (termCOMP 2015). - Jürgen Giesl; Frédéric Mesnard; Albert Rubio; René Thiemann; Johannes Waldmann (CADE, 2015)

Matrix Interpretations on Polyhedral Domains. - Johannes Waldmann (RTA, 2015)

Efficient Completion of Weighted Automata. - Johannes Waldmann (TERMGRAPH, 2016)

Automatische Erzeugung und Bewertung von Aufgaben zu Algorithmen und Datenstrukturen(Generating and Grading Exercises on Algorithms and Data Structures Automatically). - Johannes Waldmann (ABP, 2017)

When You Should Use Lists in Haskell (Mostly, You Should Not). - Johannes Waldmann (CoRR, 2018)

Sparse Tiling Through Overlap Closures for Termination of String Rewriting. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (FSCD, 2019)

The Termination and Complexity Competition. - Jürgen Giesl; Albert Rubio; Christian Sternagel; Johannes Waldmann; Akihisa Yamada 002 (TACAS (3), 2019)

Check Your (Students') Proofs-With Holes. - Dennis Renz; Sibylle Schwarz; Johannes Waldmann (CoRR, 2020)

Old and New Benchmarks for Relative Termination of String Rewrite Systems. - Dieter Hofbauer; Johannes Waldmann (CoRR, 2023)