Ein Verfahren zur Einschließung der Lösung des Anfangswertproblems. - Jürgen Avenhaus (Computing, 1971)

En En-1-entscheidbare Gruppen. - Jürgen Avenhaus; Klaus Madlener (Automata Theory and Formal Languages, 1975)

Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität. - Jürgen Avenhaus; Klaus Madlener (Acta Informatica, 1977)

Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. - Jürgen Avenhaus; Klaus Madlener (Acta Informatica, 1978)

Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. - Jürgen Avenhaus; Klaus Madlener (Arch. Math. Log., 1978)

How to Compute Generators for the Intersection of Subgroups in Free Groups. - Jürgen Avenhaus; Klaus Madlener (CAAP, 1981)

P-Complete Problems in Free Groups. - Jürgen Avenhaus; Klaus Madlener (Theoretical Computer Science, 1981)

An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation. - Jürgen Avenhaus; Klaus Madlener (RAIRO Theor. Informatics Appl., 1981)

The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups. - Jürgen Avenhaus; Klaus Madlener (EUROCAM, 1982)

Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language. - Norbert Heck; Jürgen Avenhaus (FGCS, 1984)

On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids. - Jürgen Avenhaus; Ronald V. Book; Craig C. Squier (RAIRO Theor. Informatics Appl., 1984)

The Nielsen Reduction and P-Complete Problems in Free Groups. - Jürgen Avenhaus; Klaus Madlener (Theor. Comput. Sci., 1984)

On the Complexity of Intersection and Conjugacy Problems in Free Groups. - Jürgen Avenhaus; Klaus Madlener (Theor. Comput. Sci., 1984)

On Logic Programs with Data-Driven Computations. - Norbert Heck; Jürgen Avenhaus (European Conference on Computer Algebra (2), 1985)

TRSPEC: A Term Rewriting Based System for Algebraic Specifications. - Jürgen Avenhaus; Benjamin Benninghofen; Rüdiger Göbel; Klaus Madlener (CADE, 1986)

On the Descriptive Power of Term Rewriting Systems. - Jürgen Avenhaus (J. Symb. Comput., 1986)

TRSPEC: A Term Rewriting Based System for Algebraic Specifications. - Jürgen Avenhaus; Richard Göbel; Bernhard Gramlich; Klaus Madlener; Joachim Steinbach (CTRS, 1987)

Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups. - Jürgen Avenhaus; Dieter Wissmann (ISSAC, 1989)

THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques. - Jürgen Avenhaus; Jörg Denzinger; Jürgen Müller 007 (RTA, 1989)

COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. - Jürgen Avenhaus; Klaus Madlener; Joachim Steinbach (RTA, 1989)

Proving Equational and Inductive Theorems by Completion and Embedding Techniques. - Jürgen Avenhaus (RTA, 1991)

Distributing Equational Theorem Proving. - Jürgen Avenhaus; Jörg Denzinger (RTA, 1993)

Higher Order Conditional Rewriting and Narrowing. - Jürgen Avenhaus; Carlos Loría-Sáenz (CCL, 1994)

On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs. - Jürgen Avenhaus; Carlos Loría-Sáenz (LPAR, 1994)

Operational Specifications with Built-Ins. - Jürgen Avenhaus; Klaus Becker 002 (STACS, 1994)

Reduktionssysteme - Rechnen und Schliessen in gleichungsdefinierten Strukturen. - Jürgen Avenhaus (Springer, 1995)

DISCOUNT: A SYstem for Distributed Equational Deduction. - Jürgen Avenhaus; Jörg Denzinger; Matthias Fuchs (RTA, 1995)

Theorembeweisen in hierarchischen bedingten Spezifikationen. - Jürgen Avenhaus; Klaus Madlener (Inform. Forsch. Entwickl., 1996)

Theorem Proving in Hierarchical Causal Specifications. - Jürgen Avenhaus; Klaus Madlener (Advances in Algorithms, Languages, and Complexity, 1997)

Entwicklung großer Systeme mit generischen Methoden - Eine Übersicht über den Sonderforschungsbereich 501. - 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 (Inform. Forsch. Entwickl., 1998)

A Framework for Operational Equational Specifications with Pre-defined Structures. - Jürgen Avenhaus; Klaus Becker 002 (J. Symb. Comput., 1999)

Logicality of conditional rewrite systems. - Toshiyuki Yamada; Jürgen Avenhaus; Carlos Loría-Sáenz; Aart Middeldorp (Theor. Comput. Sci., 2000)

CCE: Testing Ground Joinability. - Jürgen Avenhaus; Bernd Löchner (IJCAR, 2001)

Combining Parallel and Distributed Search in Automated Equational Deduction. - Carsten Sinz; Jörg Denzinger; Jürgen Avenhaus; Wolfgang Küchlin (PPAM, 2001)

General Algorithms for Permutations in Equational Inference. - Jürgen Avenhaus; David A. Plaisted (J. Autom. Reason., 2001)

How to Prove Inductive Theorems? QUODLIBET! - Jürgen Avenhaus; Ulrich Kühler; Tobias Schmidt-Samoa; Claus-Peter Wirth (CADE, 2003)

On using ground joinable equations in equational theorem proving. - Jürgen Avenhaus; Thomas Hillenbrand; Bernd Löchner (J. Symb. Comput., 2003)

Efficient Algorithms for Computing Modulo Permutation Theories. - Jürgen Avenhaus (IJCAR, 2004)