| Excessively duplicating patterns represent non-regular languages | 0 | 0.34 | 2014 |
| Automatic Evaluation of Reductions between NP-Complete Problems. | 0 | 0.34 | 2014 |
| Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints | 1 | 0.38 | 2013 |
| Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories | 13 | 0.69 | 2013 |
| Non-Linear Rewrite Closure and Weak Normalization | 1 | 0.39 | 2013 |
| Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories | 0 | 0.34 | 2013 |
| The HOM Problem is EXPTIME-Complete | 1 | 0.39 | 2012 |
| One-context Unification with STG-Compressed Terms is in NP. | 4 | 0.42 | 2012 |
| Learning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions. | 0 | 0.34 | 2011 |
| Context unification with one context variable | 4 | 0.41 | 2010 |
| Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories | 0 | 0.34 | 2010 |
| The HOM problem is decidable | 7 | 0.61 | 2010 |
| The Emptiness Problem for Tree Automata with Global Constraints | 12 | 0.82 | 2010 |
| Normalization properties for Shallow TRS and Innermost Rewriting | 0 | 0.34 | 2010 |
| Unification and Matching on Compressed Terms | 10 | 0.53 | 2010 |
| Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories | 0 | 0.34 | 2010 |
| Undecidable properties of flat term rewrite systems | 3 | 0.42 | 2009 |
| Unification with Singleton Tree Grammars | 4 | 0.41 | 2009 |
| Unique Normalization for Shallow TRS | 3 | 0.68 | 2009 |
| Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete | 3 | 0.43 | 2009 |
| Invariant Checking for Programs with Procedure Calls | 7 | 0.49 | 2009 |
| Closure of Tree Automata Languages under Innermost Rewriting | 4 | 0.43 | 2009 |
| Context Matching for Compressed Terms | 10 | 0.61 | 2008 |
| Classes of tree homomorphisms with decidable preservation of regularity | 3 | 0.42 | 2008 |
| Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems | 4 | 0.43 | 2007 |
| On the Normalization and Unique Normalization Properties of Term Rewrite Systems | 6 | 0.52 | 2007 |
| Termination of rewriting with right-flat rules | 6 | 0.49 | 2007 |
| Recursive path orderings can also be incremental | 1 | 0.39 | 2005 |
| Confluence of shallow right-linear rewrite systems | 15 | 0.77 | 2005 |
| Orderings for Innermost Termination | 4 | 0.39 | 2005 |
| Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules | 8 | 0.58 | 2005 |
| Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups | 0 | 0.34 | 2004 |
| Deciding confluence of certain term rewriting systems in polynomial time | 6 | 0.54 | 2004 |
| Classes of term rewrite systems with polynomial confluence problems | 7 | 0.60 | 2004 |
| Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems | 8 | 0.57 | 2004 |
| Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure | 11 | 0.68 | 2004 |
| Superposition with completely built-in Abelian groups | 7 | 0.78 | 2004 |
| Paramodulation and Knuth–Bendix Completion with Nontotal and Nonmonotonic Orderings | 5 | 0.48 | 2003 |
| On the Confluence of Linear Shallow Term Rewrite Systems | 19 | 1.00 | 2003 |
| On the Completeness of Arbitrary Selection Strategies for Paramodulation | 4 | 0.47 | 2001 |
| On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups | 3 | 0.39 | 2001 |
| Paramodulation with Built-In Abelian Groups | 7 | 0.47 | 2000 |
| Modular Redundancy for Theorem Proving | 0 | 0.34 | 2000 |
| Paramodulation with non-monotonic orderings | 9 | 0.60 | 1999 |
