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, Nachum"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Jumping and escaping: Modular termination and the abstract path ordering
Nachum Dershowitz
Theoretical Computer Science
464
, 2012, pp. 35-47
More patterns in trees: Up and down, young and old, odd and even
Nachum Dershowitz
,
Shmuel Zaks
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 447-465
Leanest quasi-orderings
Nachum Dershowitz
,
E. Castedo Ellerman
Information and Computation
205
(4), 2007, pp. 535-556
Complexity of propositional proofs under a promise
Nachum Dershowitz
,
Iddo Tzameret
Lecture Notes in Computer Science
4596
, 2007, pp. 291-302
Abstract canonical presentations
Nachum Dershowitz
,
Claude Kirchner
Theoretical Computer Science
357
(1-3), 2006, pp. 53-69
Abstract and-parallel machines
Nachum Dershowitz
,
Naomi Lindenstrauss
Lecture Notes in Computer Science
1300
, 1997, pp. 1221-1225
When are two rewrite systems more than none?
Nachum Dershowitz
Lecture Notes in Computer Science
1295
, 1997, pp. 37-43
Natural termination
Nachum Dershowitz
,
Charles Hoot
Theoretical Computer Science
142
(2), 1995, pp. 179-207
Equational inference, canonical proofs, and proof orderings
Leo Bachmair
,
Nachum Dershowitz
Journal of the ACM
41
(2), 1994, March, pp. 236-276
Logical debugging
Nachum Dershowitz
,
Yuh-Jeng Lee
Journal Symbolic Computation
15
(5-6), 1993, pp. 745-773
Higher-order and semantic unification
Nachum Dershowitz
,
Subrata Mitra
Lecture Notes in Computer Science
761
, 1993, pp. 139-150
Deductive and inductive synthesis of equational programs
Nachum Dershowitz
,
Uday S. Reddy
Journal Symbolic Computation
15
(5-6), 1993, pp. 467-494
A taste of rewrite systems
Nachum Dershowitz
Technical Report (1993-5), 1993
The cycle and some applications
Nachum Dershowitz
,
Shmuel Zaks
European Journal of Combinatorics
11
, 1990, pp. 35-40
A rationale for conditional equational programming
Nachum Dershowitz
Theoretical Computer Science
75
, 1990, pp. 111-138
Completion for rewriting modulo a congruence
Leo Bachmair
,
Nachum Dershowitz
Theoretical Computer Science
67
, 1989, pp. 173-201
Patterns in trees
Nachum Dershowitz
,
Shmuel Zaks
Discrete Applied Mathematics
25
, 1989, pp. 241-255
Critical pair criteria for completion
Leo Bachmair
,
Nachum Dershowitz
Journal Symbolic Computation
6
(1), 1988, pp. 1-18
Existene, uniqueness, and construction of rewrite systems
Nachum Dershowitz
,
Leo Marcus
,
Andrzej Tarlecki
SIAM Journal on Computing
17
, 1988, pp. 629-639
Termination of rewriting
Nachum Dershowitz
Journal Symbolic Computation
3
(1-2), 1987, pp. 69-115
Termination of linear rewriting systems
Nachum Dershowitz
Lecture Notes in Computer Science
115
, 1981, pp. 448-458
Enumerations of ordered trees
Nachum Dershowitz
,
Shmuel Zaks
Discrete Mathematics
31
, 1980, pp. 9-28
The evolution of programs: automatic program modification
Nachum Dershowitz
,
Zohar Manna
IEEE Transactions on Software Engineering
SE-3
(6), 1977, November, pp. 377-385