Klaus Madlener

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