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="Plaisted, David A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of some complementation problems
David A. Plaisted
,
Gregory Kucherov
Information Processing Letters
71
(3-4), 1999, pp. 159-165
Proof lengths for equational completion
David A. Plaisted
,
Andrea Sattler-Klein
Information and Computation
125
(2), 1996, pp. 154-170
On the mechanical derivation of loop invariants
Ritu Chadha
,
David A. Plaisted
Journal Symbolic Computation
15
(5-6), 1993, pp. 705-744
Term rewriting: Some experimental results
David A. Plaisted
,
Richard C. Potter
Journal Symbolic Computation
11
(1-2), 1991, pp. 149-180
A heuristic algorithm for small separators in arbitrary graphs
David A. Plaisted
SIAM Journal on Computing
19
, 1990, pp. 267-280
A structure-preserving clause form translation
David A. Plaisted
,
Steven Greenbaum
Journal Symbolic Computation
2
(3), 1986, pp. 293-304
Termination orderings for associative-commutative rewriting systems
Leo Bachmair
,
David A. Plaisted
Journal Symbolic Computation
1
(4), 1985, pp. 329-349
An NP-complete matching problem
David A. Plaisted
,
Shmuel Zaks
Discrete Applied Mathematics
2
, 1980, pp. 65-72