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="Madlener, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On weakly confluent monadic string-rewriting systems
K. Madlener
,
P. Narendran
,
F. Otto
,
L. Zhang
Theoretical Computer Science
113
, 1993, pp. 119-165
A specialized completion procedure for monadic string-rewriting systems presenting groups
K. Madlener
,
P. Narendran
,
F. Otto
Lecture Notes in Computer Science
510
, 1991, pp. 279-290
A method for enumerating cosets of a group presented by a canonical system
N. Kuhn
,
K. Madlener
Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC'89 (Portland, Oregon, July 17-19, 1989)
, 1989, pp. 338-350
Using string-rewriting for solving the word problem for finitely presented groups
K. Madlener
,
F. Otto
Information Processing Letters
24
(5), 1987, March, pp. 281-284
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