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="Loveland, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding critical sets
D.W. Loveland
Journal of Algorithms
8
(3), 1987, September, pp. 362-371
Performance bounds for binary testing with arbitrary weights
D.W. Loveland
Acta Informatica
22
(1), 1985, pp. 101-114
Deleting repeated goals in the problem reduction format
D.W. Loveland
,
C.R. Reddy
Journal of the ACM
28
(4), 1981, pp. 646-661
Presburger arithmetic with bounded quantifier alternation
C.R. Reddy
,
D.W. Loveland
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'78 (San Diego, CA, May 1-3, 1978)
, 1978, pp. 320-325
An implementation of the model elimination proof procedure
S. Fleisig
,
D. Loveland
,
A.K. Smiley III
,
D.L. Yarmush
Journal of the ACM
21
, 1974, pp. 124-139
A unifying view of some linear Herbrand procedures
D.W. Loveland
Journal of the ACM
19
, 1972, pp. 366-384
On minimal program complexity measures
D.W. Loveland
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, STOC'69 (Marina del Rey, CA, May 5-7, 1969)
, 1969, pp. 61-65
A simplified format for the model elimination theorem-proving procedure
D.W. Loveland
Journal of the ACM
16
, 1969, pp. 349-363
A variant of the Kolmogorov concept of complexity
D.W. Loveland
Information and Control
15
, 1969, pp. 510-526