The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Klaus Madlener: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jürgen Avenhaus, Klaus Madlener
    En\En-1-entscheidbare Gruppen. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:42-51 [Conf]
  2. Jürgen Avenhaus, Klaus Madlener
    Theorem Proving in Hierarchical Causal Specifications. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:1-51 [Conf]
  3. Jürgen Avenhaus, Klaus Madlener
    How to Compute Generators for the Intersection of Subgroups in Free Groups. [Citation Graph (0, 0)][DBLP]
    CAAP, 1981, pp:88-100 [Conf]
  4. Jürgen Avenhaus, Benjamin Benninghofen, Rüdiger Göbel, Klaus Madlener
    TRSPEC: A Term Rewriting Based System for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:665-667 [Conf]
  5. Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach
    TRSPEC: A Term Rewriting Based System for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:245-248 [Conf]
  6. Jürgen Avenhaus, Klaus Madlener
    The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups. [Citation Graph (0, 0)][DBLP]
    EUROCAM, 1982, pp:49-56 [Conf]
  7. Klaus Madlener, Paliath Narendran, Friedrich Otto
    A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:279-290 [Conf]
  8. Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein
    Generating Small Convergent Systems Can Be Extremely Hard. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:299-308 [Conf]
  9. Norbert Kuhn, Klaus Madlener
    A Method for Enumerating Cosets of a Group Presented by a Canonical System. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1989, pp:338-350 [Conf]
  10. Norbert Kuhn, Klaus Madlener, Friedrich Otto
    A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:8-15 [Conf]
  11. Norbert Kuhn, Klaus Madlener, Friedrich Otto
    Computing Presentations for Subgroups of Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1992, pp:240-250 [Conf]
  12. Klaus Madlener, Birgit Reinert
    Computing Gröbner Bases in Monoid and Group Rings. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1993, pp:254-263 [Conf]
  13. Birgit Reinert, Klaus Madlener, Teo Mora
    A Note on Nielsen Reduction and Coset Enumeration. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:171-178 [Conf]
  14. Jürgen Avenhaus, Klaus Madlener, Joachim Steinbach
    COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:542-546 [Conf]
  15. Klaus Madlener
    Applications of Rewrite Techniques in Monoids and Rings (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:260- [Conf]
  16. Klaus Madlener, Friedrich Otto
    Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:133-144 [Conf]
  17. Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener
    Automatic Monoids Versus Monoids with Finite Convergent Presentations. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:32-46 [Conf]
  18. Klaus Madlener, Friedrich Otto
    Decidable Sentences for Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:160-171 [Conf]
  19. Jürgen Avenhaus, Klaus Madlener
    P-Complete Problems in Free Groups. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:42-51 [Conf]
  20. Norbert Kuhn, Klaus Madlener, Friedrich Otto
    Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:287-316 [Journal]
  21. Klaus Madlener, Birgit Reinert
    A Generalization of Gröbner Basis Algorithms to Nilpotent Group Rings. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:2, pp:103-123 [Journal]
  22. Jürgen Avenhaus, Klaus Madlener
    Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1977, v:9, n:, pp:87-104 [Journal]
  23. Jürgen Avenhaus, Klaus Madlener
    Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1978, v:9, n:, pp:183-193 [Journal]
  24. Klaus Madlener, Friedrich Otto
    Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:31-44 [Journal]
  25. 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. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 1998, v:13, n:4, pp:227-234 [Journal]
  26. Jürgen Avenhaus, Klaus Madlener
    Theorembeweisen in hierarchischen bedingten Spezifikationen. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 1996, v:11, n:2, pp:53-60 [Journal]
  27. Klaus Madlener, Friedrich Otto
    Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:281-284 [Journal]
  28. Jürgen Avenhaus, Klaus Madlener
    An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation. [Citation Graph (0, 0)][DBLP]
    ITA, 1981, v:15, n:4, pp:335-371 [Journal]
  29. Klaus Madlener, Friedrich Otto
    Commutativity in Groups Presented By Finite Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
    ITA, 1988, v:22, n:1, pp:93-111 [Journal]
  30. Klaus Madlener, Friedrich Otto
    Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1985, v:1, n:4, pp:383-418 [Journal]
  31. Klaus Madlener, Friedrich Otto
    Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1988, v:5, n:3, pp:339-358 [Journal]
  32. Klaus Madlener, Birgit Reinert
    A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:25, n:1, pp:23-43 [Journal]
  33. Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto
    On the Problem of Generating Small Convergent Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1993, v:16, n:2, pp:167-187 [Journal]
  34. Friedrich Otto, Daniel E. Cohen, Klaus Madlener
    Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1993, v:39, n:, pp:143-157 [Journal]
  35. Jürgen Avenhaus, Klaus Madlener
    The Nielsen Reduction and P-Complete Problems in Free Groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:61-76 [Journal]
  36. Jürgen Avenhaus, Klaus Madlener
    On the Complexity of Intersection and Conjugacy Problems in Free Groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:279-295 [Journal]
  37. Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang
    On Weakly Confluent Monadic String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:113, n:1, pp:119-165 [Journal]
  38. Klaus Madlener, Friedrich Otto
    About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:143-172 [Journal]
  39. Klaus Madlener, Birgit Reinert
    Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:208, n:1-2, pp:3-31 [Journal]

Search in 0.033secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002