×

zbMATH — the first resource for mathematics

Avenhaus, Jürgen

Compute Distance To:
Author ID: avenhaus.jurgen Recent zbMATH articles by "Avenhaus, Jürgen"
Published as: Avenhaus, J.; Avenhaus, Jürgen; Avenhaus, Juergen
Documents Indexed: 36 Publications since 1971, including 1 Book
Reviewing Activity: 18 Reviews

Publications by Year

Citations contained in zbMATH Open

25 Publications have been cited 107 times in 67 Documents Cited by Year
Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität. Zbl 0371.02019
Avenhaus, J.; Madlener, K.
11
1977
String matching and algorithmic problems in free groups. Zbl 0514.20026
Avenhaus, Juergen; Madlener, Klaus
11
1980
On expressing commutativity by finite Church-Rosser presentations: A note on commutative monoids. Zbl 0542.20038
Avenhaus, Jürgen; Book, Ronald V.; Squier, Craig C.
9
1984
The Nielsen reduction and P-complete problems in free groups. Zbl 0555.20015
Avenhaus, J.; Madlener, K.
9
1984
Groups presented by finite two-monadic Church-Rosser Thue systems. Zbl 0604.20034
Avenhaus, J.; Madlener, K.; Otto, F.
8
1986
On groups defined by monadic Thue systems. Zbl 0608.20045
Avenhaus, J.; Madlener, K.
8
1986
Term rewriting and equational reasoning. Zbl 0704.68061
Avenhaus, J.; Madlener, K.
7
1990
Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen. Zbl 0371.02020
Avenhaus, Jürgen; Madlener, K.
7
1978
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Zbl 0396.03040
Avenhaus, J.; Madlener, K.
5
1978
How to compute generators for the intersection of subgroups in free groups. Zbl 0466.68036
Avenhaus, J.; Madlener, K.
5
1981
On the complexity of intersection and conjugacy problems in free groups. Zbl 0555.20016
Avenhaus, J.; Madlener, K.
5
1984
Logicality of conditional rewrite systems. Zbl 0938.68050
Yamada, T.; Avenhaus, J.; Loría-Sáenz, C.; Middeldorp, A.
4
2000
On using ground joinable equations in equational theorem proving. Zbl 1019.03005
Avenhaus, J.; Hillenbrand, Th.; Löchner, B.
2
2003
Theorem proving in hierarchical clausal specifications. Zbl 0867.68096
Avenhaus, J.; Madlener, K.
2
1997
Zur numerischen Behandlung des Anfangswertproblems mit exakter Fehlererfassung. Zbl 0216.23403
Avenhaus, J.
2
1971
Reduction systems. (Reduktionssysteme: Rechnen und Schließen in gleichungsdefinierten Strukturen.) Zbl 0827.68063
Avenhaus, Jürgen
2
1995
String matching and algorithmic problems in free groups. Zbl 0431.03031
Avenhaus, Jürgen; Madlener, Klaus
2
1980
General algorithms for permutations in equational inference. Zbl 0985.68026
Avenhaus, Jürgen; Plaisted, David A.
1
2001
A framework for operational equational specifications with pre-defined structures. Zbl 0928.68078
Avenhaus, Jürgen; Becker, Klaus
1
1999
CCE: Testing ground joinability. Zbl 0988.68587
Avenhaus, Jürgen; Löchner, Bernd
1
2001
\(E_n-E_{n-1}\)-entscheidbare Gruppen. Zbl 0314.02055
Avenhaus, J.; Madlener, K.
1
1975
Komplexitätsuntersuchungen für Einrelatorgruppen. Zbl 0359.02044
Avenhaus, J.; Madlener, K.
1
1977
Komplexität bei Gruppen: Der Einbettungssatz von Higman. Zbl 0363.20030
Avenhaus, J.; Madlener, K.
1
1977
An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation. Zbl 0494.20020
Avenhaus, J.; Madlener, K.
1
1981
The Nielsen reduction as key problem to polynomial algorithms in free groups. Zbl 0548.68038
Avenhaus, J.; Madlener, K.
1
1982
On using ground joinable equations in equational theorem proving. Zbl 1019.03005
Avenhaus, J.; Hillenbrand, Th.; Löchner, B.
2
2003
General algorithms for permutations in equational inference. Zbl 0985.68026
Avenhaus, Jürgen; Plaisted, David A.
1
2001
CCE: Testing ground joinability. Zbl 0988.68587
Avenhaus, Jürgen; Löchner, Bernd
1
2001
Logicality of conditional rewrite systems. Zbl 0938.68050
Yamada, T.; Avenhaus, J.; Loría-Sáenz, C.; Middeldorp, A.
4
2000
A framework for operational equational specifications with pre-defined structures. Zbl 0928.68078
Avenhaus, Jürgen; Becker, Klaus
1
1999
Theorem proving in hierarchical clausal specifications. Zbl 0867.68096
Avenhaus, J.; Madlener, K.
2
1997
Reduction systems. (Reduktionssysteme: Rechnen und Schließen in gleichungsdefinierten Strukturen.) Zbl 0827.68063
Avenhaus, Jürgen
2
1995
Term rewriting and equational reasoning. Zbl 0704.68061
Avenhaus, J.; Madlener, K.
7
1990
Groups presented by finite two-monadic Church-Rosser Thue systems. Zbl 0604.20034
Avenhaus, J.; Madlener, K.; Otto, F.
8
1986
On groups defined by monadic Thue systems. Zbl 0608.20045
Avenhaus, J.; Madlener, K.
8
1986
On expressing commutativity by finite Church-Rosser presentations: A note on commutative monoids. Zbl 0542.20038
Avenhaus, Jürgen; Book, Ronald V.; Squier, Craig C.
9
1984
The Nielsen reduction and P-complete problems in free groups. Zbl 0555.20015
Avenhaus, J.; Madlener, K.
9
1984
On the complexity of intersection and conjugacy problems in free groups. Zbl 0555.20016
Avenhaus, J.; Madlener, K.
5
1984
The Nielsen reduction as key problem to polynomial algorithms in free groups. Zbl 0548.68038
Avenhaus, J.; Madlener, K.
1
1982
How to compute generators for the intersection of subgroups in free groups. Zbl 0466.68036
Avenhaus, J.; Madlener, K.
5
1981
An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation. Zbl 0494.20020
Avenhaus, J.; Madlener, K.
1
1981
String matching and algorithmic problems in free groups. Zbl 0514.20026
Avenhaus, Juergen; Madlener, Klaus
11
1980
String matching and algorithmic problems in free groups. Zbl 0431.03031
Avenhaus, Jürgen; Madlener, Klaus
2
1980
Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen. Zbl 0371.02020
Avenhaus, Jürgen; Madlener, K.
7
1978
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Zbl 0396.03040
Avenhaus, J.; Madlener, K.
5
1978
Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität. Zbl 0371.02019
Avenhaus, J.; Madlener, K.
11
1977
Komplexitätsuntersuchungen für Einrelatorgruppen. Zbl 0359.02044
Avenhaus, J.; Madlener, K.
1
1977
Komplexität bei Gruppen: Der Einbettungssatz von Higman. Zbl 0363.20030
Avenhaus, J.; Madlener, K.
1
1977
\(E_n-E_{n-1}\)-entscheidbare Gruppen. Zbl 0314.02055
Avenhaus, J.; Madlener, K.
1
1975
Zur numerischen Behandlung des Anfangswertproblems mit exakter Fehlererfassung. Zbl 0216.23403
Avenhaus, J.
2
1971

Citations by Year