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
Hilfe
Suche: Author="Narendran, P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
J. Gallier
,
P. Narendran
,
D. Plaisted
,
S. Raatz
,
W. Snyder
Journal of the ACM
40
(1), 1993, January, pp. 1-16
On weakly confluent monadic string-rewriting systems
K. Madlener
,
P. Narendran
,
F. Otto
,
L. Zhang
Theoretical Computer Science
113
, 1993, pp. 119-165
Theorem proving using equational matings and rigid
E
-unification
J. Gallier
,
P. Narendran
,
S. Raatz
,
W. Snyder
Journal of the ACM
39
(2), 1992, April, pp. 377-429
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
On sufficient-completeness and related properties of term rewriting systems
D. Kapur
,
P. Narendran
,
H. Zhang
Acta Informatica
24
(4), 1987, pp. 395-415
Complexity of Matching problems
D. Benanav
,
D. Kapur
,
P. Narendran
Rewriting Techniques and Applications. Lecture Notes in Computer Science
202
, 1986, pp. 417-429
An Ideal-Theoretic Approach to Word Problems and Unification Problems over Finitely Presented Commutative Algebras
A. Kandri-Rody
,
D. Kapur
,
P. Narendran
Rewriting Techniques and Applications. Lecture Notes in Computer Science
202
, 1986, pp. 345-364
The problems of cyclic equality and conjugacy for finite complete rewriting systems
P. Narendran
,
F. Otto
Theoretical Computer Science
47
(1), 1986, pp. 27-38
On the equivalence problem for regular Thue systems
P. Narendran
Theoretical Computer Science
44
(2), 1986, pp. 237-245
An
O({|T|}^3)
algorithm for testing the Church-Rosser property of Thue systems
D. Kapur
,
M.S. Krishnamoorthy
,
R. McNaughton
,
P. Narendran
Theoretical Computer Science
35
(1), 1985, pp. 109-114
The church-rosser property and special thue systems
D. Kapur
,
P. Narendran
,
M.S. Krishnamoorthy
,
McNaughton
,
R.
Theoretical Computer Science
39
(2-3), 1985, pp. 123-133
The Knuth-Bendix completion procedure and Thue systems
D. Kapur
,
P. Narendran
SIAM Journal on Computing
14
(4), 1985, November, pp. 1052-1072
A finite Thue system with decidable word problem and without equivalent finite canonical system
D. Kapur
,
P. Narendran
Theoretical Computer Science
35
(2,3), 1985, pp. 337-344
On recursive path ordering
M.S. Krishnamoorthy
,
P. Narendran
Theoretical Computer Science
40
(2,3), 1985, pp. 323-328
Complexity of certain decision problems about congruential languages
P. Narendran
,
C. O'DĂșnlaing
,
H. Rolletschek
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 343-358
Complexity results on the conjugacy problem for monoids
P. Narendran
,
F. Otto
Theoretical Computer Science
35
(2,3), 1985, pp. 227-243
The undecidability of the preperfectness of Thue systems
P. Narendran
,
R. McNaughton
Theoretical Computer Science
31
(1,2), 1984, pp. 165-174
The uniform conjugacy problem for finite Church-Rosser Thue systems is
NP
-complete
P. Narendran
,
F. Otto
,
K. Winklmann
Information and Control
63
(1/2), 1984, pp. 58-66
A Path Reordering for Proving Termination of Term Rewriting Systems
D. Kapur
,
P. Narendran
,
G. Sivakumar
Book47, pp. 173-187