| Publication | Date of Publication | Type |
|---|
| One-context Unification with STG-Compressed Terms is in NP | 2020-05-27 | Paper |
| Classes of term rewrite systems with polynomial confluence problems | 2017-07-12 | Paper |
| The HOM Problem is EXPTIME-Complete | 2017-05-16 | Paper |
| The HOM Problem is EXPTIME-Complete | 2016-08-16 | Paper |
| Unification and matching on compressed terms | 2015-09-17 | Paper |
| Non-linear rewrite closure and weak normalization | 2015-06-23 | Paper |
| Emptiness and finiteness for tree automata with global reflexive disequality constraints | 2015-06-23 | Paper |
| Automatic Evaluation of Reductions between NP-Complete Problems | 2014-09-26 | Paper |
| The HOM problem is decidable | 2014-08-13 | Paper |
| Automatic Evaluation of Context-Free Grammars (System Description) | 2014-07-24 | Paper |
| Tree Automata with Height Constraints between Brothers | 2014-07-24 | Paper |
| Closure of Tree Automata Languages under Innermost Rewriting | 2014-07-22 | Paper |
| Excessively duplicating patterns represent non-regular languages | 2014-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395720 | 2014-02-17 | Paper |
| Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories | 2013-06-20 | Paper |
| Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete | 2011-07-29 | Paper |
| Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories | 2010-09-21 | Paper |
| Normalization properties for shallow TRS and innermost rewriting | 2010-04-20 | Paper |
| Context unification with one context variable | 2009-12-03 | Paper |
| Undecidable properties of flat term rewrite systems | 2009-10-19 | Paper |
| Invariant Checking for Programs with Procedure Calls | 2009-08-18 | Paper |
| Unique Normalization for Shallow TRS | 2009-06-30 | Paper |
| Unification with Singleton Tree Grammars | 2009-06-30 | Paper |
| On the Normalization and Unique Normalization Properties of Term Rewrite Systems | 2009-03-06 | Paper |
| Recursive Path Orderings Can Also Be Incremental | 2008-05-27 | Paper |
| Classes of Tree Homomorphisms with Decidable Preservation of Regularity | 2008-04-11 | Paper |
| Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems | 2008-01-02 | Paper |
| Termination of Rewriting with Right-Flat Rules | 2008-01-02 | Paper |
| Automated Reasoning | 2007-09-25 | Paper |
| Computer Science Logic | 2006-11-01 | Paper |
| Automated Deduction – CADE-20 | 2006-11-01 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Constraint solving for term orderings compatible with abelian semigroups, monoids and groups | 2005-03-15 | Paper |
| Deciding confluence of certain term rewriting systems in polynomial time | 2004-11-18 | Paper |
| Characterizing confluence by rewrite closure and right ground term rewrite systems | 2004-10-28 | Paper |
| Superposition with completely built-in abelian groups | 2004-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418639 | 2003-08-11 | Paper |
| Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings | 2003-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535075 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518870 | 2000-12-03 | Paper |
