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="Dershowitz, N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Canonical sets of Horn clauses
N. Dershowitz
Lecture Notes in Computer Science
510
, 1991, pp. 267-278
A critical pair criterion for completion modulo a congruence
L. Bachmair
,
N. Dershowitz
Lecture Notes in Computer Science
378
, 1989, pp. 452-453
Infinite normal forms
N. Dershowitz
,
S. Kaplan
,
D.A. Plaisted
Lecture Notes in Computer Science
372
, 1989, pp. 249-262
Critical-Pair Criteria for the Knuth-Bendix Completion Procedure
L. Bachmair
,
N. Dershowitz
Proceedings of the 1986 Symposium on Symbolic and Algebraic Computation
, 1986, July, pp. 215-217
Termination
N. Dershowitz
Rewriting Techniques and Applications. Lecture Notes in Computer Science
202
, 1986, pp. 180-224
Computing with rewrite systems
N. Dershowitz
Information and Control
65
(2/3), 1985, pp. 122-157
Orderings for term-rewriting systems
N. Dershowitz
Theoretical Computer Science
17
, 1982, pp. 279-301
The Schorr-Waite marking algorithm revisited
N. Dershowitz
Information Processing Letters
11
(3), 1980, November, pp. 141-143
Proving termination with multiset orderings
N. Dershowitz
,
Z. Manna
Lecture Notes in Computer Science
71
, 1979, pp. 188-202
A note on simplification orderings
N. Dershowitz
Information Processing Letters
9
(5), 1979, December, pp. 212-215
Orderings for term-rewriting systems
N. Dershowitz
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 123-131
KEDMA -- Linguistic tools for retrieval systems
R. Attar
,
Y. Choueka
,
N. Dershowitz
,
A.S. Fraenkel
Journal of the ACM
25
, 1978, pp. 52-66