Klaus Madlener

Publication Activity (10 Years)

Years Active: 1975-1998
Publications (10 Years): 0

Publications

Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener
Automatic Monoids Versus Monoids with Finite Convergent Presentations. RTA (1998)
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
Entwicklung großer Systeme mit generischen Methoden - Eine Übersicht über den Sonderforschungsbereich 501. Inform. Forsch. Entwickl. 13 (4) (1998)
Klaus Madlener, Birgit Reinert
Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings. Theor. Comput. Sci. 208 (1-2) (1998)
Klaus Madlener, Birgit Reinert
A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings. J. Symb. Comput. 25 (1) (1998)
Birgit Reinert, Klaus Madlener, Teo Mora
A Note on Nielsen Reduction and Coset Enumeration. ISSAC (1998)
Jürgen Avenhaus, Klaus Madlener
Theorem Proving in Hierarchical Causal Specifications. Advances in Algorithms, Languages, and Complexity (1997)
Klaus Madlener, Birgit Reinert
A Generalization of Gröbner Basis Algorithms to Nilpotent Group Rings. Appl. Algebra Eng. Commun. Comput. 8 (2) (1997)
Klaus Madlener, Friedrich Otto
Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. Fundam. Informaticae 30 (1) (1997)
Klaus Madlener
Applications of Rewrite Techniques in Monoids and Rings (Abstract). RTA (1996)
Jürgen Avenhaus, Klaus Madlener
Theorembeweisen in hierarchischen bedingten Spezifikationen. Inform. Forsch. Entwickl. 11 (2) (1996)
Norbert Kuhn, Klaus Madlener, Friedrich Otto
Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups. Appl. Algebra Eng. Commun. Comput. 5 (1994)
Friedrich Otto, Daniel E. Cohen, Klaus Madlener
Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups. Math. Log. Q. 39 (1993)
Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto
On the Problem of Generating Small Convergent Systems. J. Symb. Comput. 16 (2) (1993)
Klaus Madlener, Birgit Reinert
Computing Gröbner Bases in Monoid and Group Rings. ISSAC (1993)
Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang
On Weakly Confluent Monadic String-Rewriting Systems. Theor. Comput. Sci. 113 (1) (1993)
Norbert Kuhn, Klaus Madlener, Friedrich Otto
Computing Presentations for Subgroups of Context-Free Groups. ISSAC (1992)
Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein
Generating Small Convergent Systems Can Be Extremely Hard. ISAAC (1992)
Klaus Madlener, Friedrich Otto
Decidable Sentences for Context-Free Groups. STACS (1991)
Klaus Madlener, Paliath Narendran, Friedrich Otto
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. ICALP (1991)
Norbert Kuhn, Klaus Madlener, Friedrich Otto
A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem. ISSAC (1990)
Norbert Kuhn, Klaus Madlener
A Method for Enumerating Cosets of a Group Presented by a Canonical System. ISSAC (1989)
Jürgen Avenhaus, Klaus Madlener, Joachim Steinbach
COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. RTA (1989)
Deepak Kapur, Klaus Madlener
A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra. Computers and Mathematics (1989)
Klaus Madlener, Friedrich Otto
About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. Theor. Comput. Sci. 67 (2&3) (1989)
Klaus Madlener, Friedrich Otto
Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. J. Symb. Comput. 5 (3) (1988)
Klaus Madlener, Friedrich Otto
Commutativity in Groups Presented By Finite Church-Rosser Thue Systems. RAIRO Theor. Informatics Appl. 22 (1) (1988)
Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach
TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CTRS (1987)
Klaus Madlener, Friedrich Otto
Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. Inf. Process. Lett. 24 (5) (1987)
Klaus Madlener, Friedrich Otto
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. RTA (1987)
Jürgen Avenhaus, Benjamin Benninghofen, Rüdiger Göbel, Klaus Madlener
TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CADE (1986)
Klaus Madlener, Friedrich Otto
Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups. J. Symb. Comput. 1 (4) (1985)
Jürgen Avenhaus, Klaus Madlener
On the Complexity of Intersection and Conjugacy Problems in Free Groups. Theor. Comput. Sci. 32 (1984)
Jürgen Avenhaus, Klaus Madlener
The Nielsen Reduction and P-Complete Problems in Free Groups. Theor. Comput. Sci. 32 (1984)
Jürgen Avenhaus, Klaus Madlener
The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups. EUROCAM (1982)
Jürgen Avenhaus, Klaus Madlener
How to Compute Generators for the Intersection of Subgroups in Free Groups. CAAP (1981)
Jürgen Avenhaus, Klaus Madlener
P-Complete Problems in Free Groups. Theoretical Computer Science (1981)
Jürgen Avenhaus, Klaus Madlener
Extensions and the Dependence of Its Complexity on the Group Representation. RAIRO Theor. Informatics Appl. 15 (4) (1981)
Jürgen Avenhaus, Klaus Madlener
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Arch. Math. Log. 19 (1) (1978)
Jürgen Avenhaus, Klaus Madlener
Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. Acta Informatica 9 (1978)
Jürgen Avenhaus, Klaus Madlener
Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität. Acta Informatica 9 (1977)
Jürgen Avenhaus, Klaus Madlener
-entscheidbare Gruppen. Automata Theory and Formal Languages (1975)