default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Madlener
Person information
- affiliation: Kaiserslautern University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j21]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): 227-234 (1998)- [j20]Klaus Madlener, Birgit Reinert:
A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings. J. Symb. Comput. 25(1): 23-43 (1998) - [j19]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): 3-31 (1998) - [c20]Birgit Reinert, Klaus Madlener, Teo Mora:
A Note on Nielsen Reduction and Coset Enumeration. ISSAC 1998: 171-178 - [c19]Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener:
Automatic Monoids Versus Monoids with Finite Convergent Presentations. RTA 1998: 32-46 - 1997
- [j18]Klaus Madlener, Birgit Reinert:
A Generalization of Gröbner Basis Algorithms to Nilpotent Group Rings. Appl. Algebra Eng. Commun. Comput. 8(2): 103-123 (1997) - [j17]Klaus Madlener, Friedrich Otto:
Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. Fundam. Informaticae 30(1): 31-44 (1997) - [c18]Jürgen Avenhaus, Klaus Madlener:
Theorem Proving in Hierarchical Causal Specifications. Advances in Algorithms, Languages, and Complexity 1997: 1-51 - 1996
- [j16]Jürgen Avenhaus, Klaus Madlener:
Theorembeweisen in hierarchischen bedingten Spezifikationen. Inform. Forsch. Entwickl. 11(2): 53-60 (1996) - [c17]Klaus Madlener:
Applications of Rewrite Techniques in Monoids and Rings (Abstract). RTA 1996: 260 - 1994
- [j15]Norbert Kuhn, Klaus Madlener, Friedrich Otto:
Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups. Appl. Algebra Eng. Commun. Comput. 5: 287-316 (1994) - 1993
- [j14]Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto:
On the Problem of Generating Small Convergent Systems. J. Symb. Comput. 16(2): 167-187 (1993) - [j13]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: 143-157 (1993) - [j12]Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang:
On Weakly Confluent Monadic String-Rewriting Systems. Theor. Comput. Sci. 113(1): 119-165 (1993) - [c16]Klaus Madlener, Birgit Reinert:
Computing Gröbner Bases in Monoid and Group Rings. ISSAC 1993: 254-263 - 1992
- [c15]Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein:
Generating Small Convergent Systems Can Be Extremely Hard. ISAAC 1992: 299-308 - [c14]Norbert Kuhn, Klaus Madlener, Friedrich Otto:
Computing Presentations for Subgroups of Context-Free Groups. ISSAC 1992: 240-250 - 1991
- [c13]Klaus Madlener, Paliath Narendran, Friedrich Otto:
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. ICALP 1991: 279-290 - [c12]Klaus Madlener, Friedrich Otto:
Decidable Sentences for Context-Free Groups. STACS 1991: 160-171 - 1990
- [c11]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: 8-15
1980 – 1989
- 1989
- [j11]Klaus Madlener, Friedrich Otto:
About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. Theor. Comput. Sci. 67(2&3): 143-172 (1989) - [c10]Deepak Kapur, Klaus Madlener:
A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra. Computers and Mathematics 1989: 1-11 - [c9]Norbert Kuhn, Klaus Madlener:
A Method for Enumerating Cosets of a Group Presented by a Canonical System. ISSAC 1989: 338-350 - [c8]Jürgen Avenhaus, Klaus Madlener, Joachim Steinbach:
COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. RTA 1989: 542-546 - 1988
- [j10]Klaus Madlener, Friedrich Otto:
Commutativity in Groups Presented By Finite Church-Rosser Thue Systems. RAIRO Theor. Informatics Appl. 22(1): 93-111 (1988) - [j9]Klaus Madlener, Friedrich Otto:
Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. J. Symb. Comput. 5(3): 339-358 (1988) - 1987
- [j8]Klaus Madlener, Friedrich Otto:
Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. Inf. Process. Lett. 24(5): 281-284 (1987) - [c7]Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach:
TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CTRS 1987: 245-248 - [c6]Klaus Madlener, Friedrich Otto:
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. RTA 1987: 133-144 - 1986
- [c5]Jürgen Avenhaus, Benjamin Benninghofen, Rüdiger Göbel, Klaus Madlener:
TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CADE 1986: 665-667 - 1985
- [j7]Klaus Madlener, Friedrich Otto:
Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups. J. Symb. Comput. 1(4): 383-418 (1985) - 1984
- [j6]Jürgen Avenhaus, Klaus Madlener:
The Nielsen Reduction and P-Complete Problems in Free Groups. Theor. Comput. Sci. 32: 61-76 (1984) - [j5]Jürgen Avenhaus, Klaus Madlener:
On the Complexity of Intersection and Conjugacy Problems in Free Groups. Theor. Comput. Sci. 32: 279-295 (1984) - 1982
- [c4]Jürgen Avenhaus, Klaus Madlener:
The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups. EUROCAM 1982: 49-56 - 1981
- [j4]Jürgen Avenhaus, Klaus Madlener:
An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation. RAIRO Theor. Informatics Appl. 15(4): 335-371 (1981) - [c3]Jürgen Avenhaus, Klaus Madlener:
How to Compute Generators for the Intersection of Subgroups in Free Groups. CAAP 1981: 88-100 - [c2]Jürgen Avenhaus, Klaus Madlener:
P-Complete Problems in Free Groups. Theoretical Computer Science 1981: 42-51
1970 – 1979
- 1978
- [j3]Jürgen Avenhaus, Klaus Madlener:
Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. Acta Informatica 9: 183-193 (1978) - [j2]Jürgen Avenhaus, Klaus Madlener:
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Arch. Math. Log. 19(1): 3-12 (1978) - 1977
- [j1]Jürgen Avenhaus, Klaus Madlener:
Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität. Acta Informatica 9: 87-104 (1977) - 1975
- [c1]Jürgen Avenhaus, Klaus Madlener:
En\En-1-entscheidbare Gruppen. Automata Theory and Formal Languages 1975: 42-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
