Klaus Madlener
According to our database1, Klaus Madlener
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:
On csauthors.net:
Bibliography
1998
Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings.
Theor. Comput. Sci., 1998
A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings.
J. Symb. Comput., 1998
Entwicklung großer Systeme mit generischen Methoden - Eine Übersicht über den Sonderforschungsbereich 501.
Inform., Forsch. Entwickl., 1998
Automatic Monoids Versus Monoids with Finite Convergent Presentations.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998
A Note on Nielsen Reduction and Coset Enumeration.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998
1997
Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet.
Fundam. Inform., 1997
A Generalization of Gröbner Basis Algorithms to Nilpotent Group Rings.
Appl. Algebra Eng. Commun. Comput., 1997
Theorem Proving in Hierarchical Causal Specifications.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997
1996
Theorembeweisen in hierarchischen bedingten Spezifikationen.
Inform., Forsch. Entwickl., 1996
Applications of Rewrite Techniques in Monoids and Rings (Abstract).
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996
1994
Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups.
Appl. Algebra Eng. Commun. Comput., 1994
1993
On Weakly Confluent Monadic String-Rewriting Systems.
Theor. Comput. Sci., 1993
Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups.
Math. Log. Q., 1993
On the Problem of Generating Small Convergent Systems.
J. Symb. Comput., 1993
Computing Gröbner Bases in Monoid and Group Rings.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993
1992
Computing Presentations for Subgroups of Context-Free Groups.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992
Generating Small Convergent Systems Can Be Extremely Hard.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
1991
Decidable Sentences for Context-Free Groups.
Proceedings of the STACS 91, 1991
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
1990
A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990
1989
About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems.
Theor. Comput. Sci., 1989
COMTES - An Experimental Environment for the Completion of Term Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989
A Method for Enumerating Cosets of a Group Presented by a Canonical System.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989
1988
Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups.
J. Symb. Comput., 1988
Commutativity in Groups Presented By Finite Church-Rosser Thue Systems.
ITA, 1988
1987
Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups.
Inf. Process. Lett., 1987
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987
TRSPEC: A Term Rewriting Based System for Algebraic Specifications.
Proceedings of the Conditional Term Rewriting Systems, 1987
1986
TRSPEC: A Term Rewriting Based System for Algebraic Specifications.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986
1985
Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups.
J. Symb. Comput., 1985
1984
On the Complexity of Intersection and Conjugacy Problems in Free Groups.
Theor. Comput. Sci., 1984
The Nielsen Reduction and P-Complete Problems in Free Groups.
Theor. Comput. Sci., 1984
1982
The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups.
Proceedings of the Computer Algebra, 1982
1981
An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation.
ITA, 1981
P-Complete Problems in Free Groups.
Proceedings of the Theoretical Computer Science, 1981
How to Compute Generators for the Intersection of Subgroups in Free Groups.
Proceedings of the CAAP '81, 1981
1978
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität.
Arch. Math. Log., 1978
Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen.
Acta Inf., 1978
1977
Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität.
Acta Inf., 1977
1975
En\En-1-entscheidbare Gruppen.
Proceedings of the Automata Theory and Formal Languages, 1975