En En-1-entscheidbare Gruppen. - Jürgen Avenhaus; Klaus Madlener (Automata Theory and Formal Languages, 1975)

Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität. - Jürgen Avenhaus; Klaus Madlener (Acta Informatica, 1977)

Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. - Jürgen Avenhaus; Klaus Madlener (Acta Informatica, 1978)

Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. - Jürgen Avenhaus; Klaus Madlener (Arch. Math. Log., 1978)

How to Compute Generators for the Intersection of Subgroups in Free Groups. - Jürgen Avenhaus; Klaus Madlener (CAAP, 1981)

P-Complete Problems in Free Groups. - Jürgen Avenhaus; Klaus Madlener (Theoretical Computer Science, 1981)

An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation. - Jürgen Avenhaus; Klaus Madlener (RAIRO Theor. Informatics Appl., 1981)

The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups. - Jürgen Avenhaus; Klaus Madlener (EUROCAM, 1982)

The Nielsen Reduction and P-Complete Problems in Free Groups. - Jürgen Avenhaus; Klaus Madlener (Theor. Comput. Sci., 1984)

On the Complexity of Intersection and Conjugacy Problems in Free Groups. - Jürgen Avenhaus; Klaus Madlener (Theor. Comput. Sci., 1984)

Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups. - Klaus Madlener; Friedrich Otto (J. Symb. Comput., 1985)

TRSPEC: A Term Rewriting Based System for Algebraic Specifications. - Jürgen Avenhaus; Benjamin Benninghofen; Rüdiger Göbel; Klaus Madlener (CADE, 1986)

TRSPEC: A Term Rewriting Based System for Algebraic Specifications. - Jürgen Avenhaus; Richard Göbel; Bernhard Gramlich; Klaus Madlener; Joachim Steinbach (CTRS, 1987)

Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. - Klaus Madlener; Friedrich Otto (RTA, 1987)

Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. - Klaus Madlener; Friedrich Otto (Inf. Process. Lett., 1987)

Commutativity in Groups Presented By Finite Church-Rosser Thue Systems. - Klaus Madlener; Friedrich Otto (RAIRO Theor. Informatics Appl., 1988)

Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. - Klaus Madlener; Friedrich Otto (J. Symb. Comput., 1988)

A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra. - Deepak Kapur; Klaus Madlener (Computers and Mathematics, 1989)

A Method for Enumerating Cosets of a Group Presented by a Canonical System. - Norbert Kuhn; Klaus Madlener (ISSAC, 1989)

COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. - Jürgen Avenhaus; Klaus Madlener; Joachim Steinbach (RTA, 1989)

About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. - Klaus Madlener; Friedrich Otto (Theor. Comput. Sci., 1989)

A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem. - Norbert Kuhn; Klaus Madlener; Friedrich Otto (ISSAC, 1990)

A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. - Klaus Madlener; Paliath Narendran; Friedrich Otto (ICALP, 1991)

Decidable Sentences for Context-Free Groups. - Klaus Madlener; Friedrich Otto (STACS, 1991)

Generating Small Convergent Systems Can Be Extremely Hard. - Klaus Madlener; Friedrich Otto; Andrea Sattler-Klein (ISAAC, 1992)

Computing Presentations for Subgroups of Context-Free Groups. - Norbert Kuhn; Klaus Madlener; Friedrich Otto (ISSAC, 1992)

Computing Gröbner Bases in Monoid and Group Rings. - Klaus Madlener; Birgit Reinert (ISSAC, 1993)

On the Problem of Generating Small Convergent Systems. - Klaus Madlener; Andrea Sattler-Klein; Friedrich Otto (J. Symb. Comput., 1993)

Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups. - Friedrich Otto; Daniel E. Cohen; Klaus Madlener (Math. Log. Q., 1993)

On Weakly Confluent Monadic String-Rewriting Systems. - Klaus Madlener; Paliath Narendran; Friedrich Otto; Louxin Zhang (Theor. Comput. Sci., 1993)

Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups. - Norbert Kuhn; Klaus Madlener; Friedrich Otto (Appl. Algebra Eng. Commun. Comput., 1994)

Applications of Rewrite Techniques in Monoids and Rings (Abstract). - Klaus Madlener (RTA, 1996)

Theorembeweisen in hierarchischen bedingten Spezifikationen. - Jürgen Avenhaus; Klaus Madlener (Inform. Forsch. Entwickl., 1996)

Theorem Proving in Hierarchical Causal Specifications. - Jürgen Avenhaus; Klaus Madlener (Advances in Algorithms, Languages, and Complexity, 1997)

A Generalization of Gröbner Basis Algorithms to Nilpotent Group Rings. - Klaus Madlener; Birgit Reinert (Appl. Algebra Eng. Commun. Comput., 1997)

Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. - Klaus Madlener; Friedrich Otto (Fundam. Informaticae, 1997)

A Note on Nielsen Reduction and Coset Enumeration. - Birgit Reinert; Klaus Madlener; Teo Mora (ISSAC, 1998)

Automatic Monoids Versus Monoids with Finite Convergent Presentations. - Friedrich Otto; Andrea Sattler-Klein; Klaus Madlener (RTA, 1998)

Entwicklung großer Systeme mit generischen Methoden - Eine Übersicht über den Sonderforschungsbereich 501. - Jürgen Avenhaus; Reinhard Gotzhein; Theo Härder; Lothar Litz; Klaus Madlener; Jürgen Nehmer; Michael M. Richter; Norbert Ritter; H. Dieter Rombach; Bernd Schürmann; Gerhard Zimmermann (Inform. Forsch. Entwickl., 1998)

A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings. - Klaus Madlener; Birgit Reinert (J. Symb. Comput., 1998)

Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings. - Klaus Madlener; Birgit Reinert (Theor. Comput. Sci., 1998)