| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6191017 | 2024-02-08 | Paper |
| Existence and Construction of a Gr\"obner Basis for a Polynomial Ideal | 2023-06-15 | Paper |
| Any ground associative-commutative theory has a finite canonical system | 2022-12-09 | Paper |
| Some independence results for equational unification | 2022-12-09 | Paper |
| It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair | 2022-08-16 | Paper |
| Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems | 2022-03-24 | Paper |
| Asymmetric unification and disunification | 2020-06-04 | Paper |
| On asymmetric unification for the theory of XOR with a homomorphism | 2020-05-13 | Paper |
| Reviving basic narrowing modulo | 2020-05-13 | Paper |
| Unification modulo lists with reverse relation with certain word equations | 2020-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967169 | 2019-07-03 | Paper |
| Unification and matching modulo nilpotence | 2019-01-15 | Paper |
| The word matching problem is undecidable for finite special string-rewriting systems that are confluent | 2018-07-04 | Paper |
| Deciding the confluence of ordered term rewrite systems | 2017-06-13 | Paper |
| Unification and Matching in Hierarchical Combinations of Syntactic Theories | 2017-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2819401 | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2819403 | 2016-09-29 | Paper |
| On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry | 2015-08-25 | Paper |
| On Asymmetric Unification and the Combination Problem in Disjoint Theories | 2014-04-16 | Paper |
| Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining | 2014-03-24 | Paper |
| On Forward Closure and the Finite Variant Property | 2013-09-20 | Paper |
| Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis | 2013-06-14 | Paper |
| Hierarchical Combination | 2013-06-14 | Paper |
| Unification Modulo Synchronous Distributivity | 2012-09-05 | Paper |
| New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants | 2012-09-05 | Paper |
| Unification modulo homomorphic encryption | 2012-07-17 | Paper |
| Unification Modulo Chaining | 2012-06-08 | Paper |
| Automated Deduction – CADE-19 | 2010-04-20 | Paper |
| Unification Modulo Homomorphic Encryption | 2010-01-07 | Paper |
| Closure properties and decision problems of dag automata | 2009-12-04 | Paper |
| On Extended Regular Expressions | 2009-04-02 | Paper |
| Unification and Matching Modulo Leaf-Permutative Equational Presentations | 2008-11-27 | Paper |
| Intruders with Caps | 2008-01-02 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Mechanizing Mathematical Reasoning | 2006-01-10 | Paper |
| Unification modulo ACUI plus distributivity axioms | 2005-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447232 | 2004-02-16 | Paper |
| Complexity of nilpotent unification and matching problems. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767094 | 2002-04-28 | Paper |
| Unification of concept terms in description logics | 2001-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936127 | 2000-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263810 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838763 | 1999-01-04 | Paper |
| Equational unification, word unification, and 2nd-order equational unification | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838767 | 1998-08-13 | Paper |
| Single versus simultaneous equational unification and equational unification for variable-permuting theories | 1998-02-04 | Paper |
| Any ground associative-commutative theory has a finite canonical system | 1997-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348024 | 1997-11-09 | Paper |
| On the unification problem for Cartesian closed categories | 1997-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864469 | 1996-02-20 | Paper |
| Codes modulo finite monadic string-rewriting systems | 1995-11-06 | Paper |
| Theorem proving using equational matings and rigid E -unification | 1994-11-13 | Paper |
| On weakly confluent monadic string-rewriting systems | 1994-01-09 | Paper |
| Complexity of unification problems with associative-commutative operators | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036570 | 1993-05-18 | Paper |
| An algorithm for finding canonical sets of ground rewrite rules in polynomial time | 1993-05-16 | Paper |
| It is undecidable whether a finite special string-rewriting system presents a group | 1992-06-28 | Paper |
| Automating inductionless induction using test sets | 1991-01-01 | Paper |
| Semi-unification | 1991-01-01 | Paper |
| Sufficient-completeness, ground-reducibility and their complexity | 1991-01-01 | Paper |
| On ground-confluence of term rewriting systems | 1990-01-01 | Paper |
| Rigid E-unification: NP-completeness and applications to equational matings | 1990-01-01 | Paper |
| It is decidable whether a monadic thue system is canonical over a regular set | 1990-01-01 | Paper |
| Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems | 1989-01-01 | Paper |
| Cancellativity in finitely presented semigroups | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832775 | 1989-01-01 | Paper |
| Only prime superpositions need be considered in the Knuth-Bendix completion procedure | 1988-01-01 | Paper |
| Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule | 1988-01-01 | Paper |
| Elements of finite order for finite weight-reducing and confluent Thue systems | 1988-01-01 | Paper |
| Church-Rosser Thue systems and formal languages | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3811749 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819992 | 1988-01-01 | Paper |
| On sufficient-completeness and related properties of term rewriting systems | 1987-01-01 | Paper |
| Special monoids and special Thue systems | 1987-01-01 | Paper |
| Complexity of matching problems | 1987-01-01 | Paper |
| Matching, unification and complexity | 1987-01-01 | Paper |
| On the regular equivalence problem for regular Thue systems | 1986-01-01 | Paper |
| The problems of cyclic equality and conjugacy for finite complete rewriting systems | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761697 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783519 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785940 | 1986-01-01 | Paper |
| An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems | 1985-01-01 | Paper |
| The Church-Rosser property and special Thue systems | 1985-01-01 | Paper |
| Complexity results on the conjugacy problem for monoids | 1985-01-01 | Paper |
| A finite Thue system with decidable word problem and without equivalent finite canonical system | 1985-01-01 | Paper |
| On recursive path ordering | 1985-01-01 | Paper |
| Complexity of certain decision problems about congruential languages | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683533 | 1985-01-01 | Paper |
| The Knuth-Bendix Completion Procedure and Thue Systems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696522 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3703293 | 1985-01-01 | Paper |
| The undecidability of the preperfectness of Thue systems | 1984-01-01 | Paper |
| The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3319767 | 1983-01-01 | Paper |
