Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Avenhaus, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the Descriptive Power of Term Rewriting Systems
J. Avenhaus
Journal Symbolic Computation
2
(2), 1986, pp. 109-122
On logic programs with data-driven computations
N. Heck
,
J. Avenhaus
Lecture Notes in Computer Science
204
, 1985, pp. 433-443
The Nielsen reduction and P-complete problems in free groups
J. Avenhaus
,
K. Madlener
Theoretical Computer Science
32
(1,2), 1984, pp. 61-76
On the complexity of intersection and conjugacy problems in free groups
J. Avenhaus
,
K. Madlener
Theoretical Computer Science
32
(3), 1984, pp. 279-295
Subrecursive complexities on groups. II. Higman's embedding theorem for decidable groups
J. Avenhaus
,
K. Madlener
Acta Informatica
9
(2), 1978, pp. 183-193
Subrecursive complexities on groups. I. Groups of given complexity
J. Avenhaus
,
K. Madlener
Acta Informatica
9
(1), 1977, pp. 87-104