The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jürgen Avenhaus: [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
    Efficient Algorithms for Computing Modulo Permutation Theories. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2004, pp:415-429 [Conf]
  5. 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]
  6. Jürgen Avenhaus, Ulrich Kühler, Tobias Schmidt-Samoa, Claus-Peter Wirth
    How to Prove Inductive Theorems? QUODLIBET! [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:328-333 [Conf]
  7. Jürgen Avenhaus, Bernd Löchner
    CCE: Testing Ground Joinability. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:658-662 [Conf]
  8. Jürgen Avenhaus, Carlos Loría-Sáenz
    Higher Order Conditional Rewriting and Narrowing. [Citation Graph (0, 0)][DBLP]
    CCL, 1994, pp:269-284 [Conf]
  9. 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]
  10. 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]
  11. Norbert Heck, Jürgen Avenhaus
    On Logic Programs with Data-Driven Computations. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:433-443 [Conf]
  12. Norbert Heck, Jürgen Avenhaus
    Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    FGCS, 1984, pp:210-219 [Conf]
  13. Jürgen Avenhaus, Dieter Wissmann
    Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1989, pp:322-337 [Conf]
  14. Jürgen Avenhaus, Carlos Loría-Sáenz
    On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1994, pp:215-229 [Conf]
  15. Carsten Sinz, Jörg Denzinger, Jürgen Avenhaus, Wolfgang Küchlin
    Combining Parallel and Distributed Search in Automated Equational Deduction. [Citation Graph (0, 0)][DBLP]
    PPAM, 2001, pp:819-832 [Conf]
  16. Jürgen Avenhaus
    Proving Equational and Inductive Theorems by Completion and Embedding Techniques. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:361-373 [Conf]
  17. Jürgen Avenhaus, Jörg Denzinger
    Distributing Equational Theorem Proving. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:62-76 [Conf]
  18. Jürgen Avenhaus, Jörg Denzinger, Matthias Fuchs
    DISCOUNT: A SYstem for Distributed Equational Deduction. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:397-402 [Conf]
  19. Jürgen Avenhaus, Jörg Denzinger, Jürgen Müller
    THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:538-541 [Conf]
  20. 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]
  21. Jürgen Avenhaus, Klaus Becker
    Operational Specifications with Built-Ins. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:263-274 [Conf]
  22. Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
    Logicality of Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:141-152 [Conf]
  23. Jürgen Avenhaus, Klaus Madlener
    P-Complete Problems in Free Groups. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:42-51 [Conf]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. Jürgen Avenhaus, Ronald V. Book, Craig C. Squier
    On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids. [Citation Graph (0, 0)][DBLP]
    ITA, 1984, v:18, n:1, pp:47-52 [Journal]
  29. 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]
  30. Jürgen Avenhaus, David A. Plaisted
    General Algorithms for Permutations in Equational Inference. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2001, v:26, n:3, pp:223-268 [Journal]
  31. Jürgen Avenhaus, Thomas Hillenbrand, Bernd Löchner
    On using ground joinable equations in equational theorem proving. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:1-2, pp:217-233 [Journal]
  32. Jürgen Avenhaus
    On the Descriptive Power of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1986, v:2, n:2, pp:109-122 [Journal]
  33. Jürgen Avenhaus, Klaus Becker
    A Framework for Operational Equational Specifications with Pre-defined Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:27, n:3, pp:271-310 [Journal]
  34. 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]
  35. 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]
  36. Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
    Logicality of conditional rewrite systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:236, n:1-2, pp:209-232 [Journal]

Search in 0.052secs, Finished in 0.055secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002