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="Plaisted, D."
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
Infinite normal forms
N. Dershowitz
,
S. Kaplan
,
D.A. Plaisted
Lecture Notes in Computer Science
372
, 1989, pp. 249-262
A heuristic triangulation algorithm
D.A. Plaisted
,
Jiarong Hong
Journal of Algorithms
8
(3), 1987, September, pp. 405-437
Associative Path Orderings
L. Bachmair
,
D.A. Plaisted
Rewriting Techniques and Applications. Lecture Notes in Computer Science
202
, 1986, pp. 241-254
The undecidability of self-embedding for term rewriting systems
D.A. Plaisted
Information Processing Letters
20
(2), 1985, February, pp. 61-64
Semantic confluence tests and completion methods
D.A. Plaisted
Information and Control
65
(2/3), 1985, pp. 182-215
Complete divisibility problems for slowly utilized oracles
D.A. Plaisted
Theoretical Computer Science
35
(2,3), 1985, pp. 245-260
Complete problems in the first-order predicate calculus
D.A. Plaisted
Journal of Computer and System Sciences
29
(1), 1984, August, pp. 8-35
Heuristic matching for graphs satisfying the triangle inequality
D.A. Plaisted
Journal of Algorithms
5
(2), 1984, pp. 163-179
New
NP
-hard and
NP
-complete polynomial and integer divisibilty problems
D.A. Plaisted
Theoretical Computer Science
31
(1,2), 1984, pp. 125-138
The traveling salesman problem and minimum matching in the unit square
K.J. Supowit
,
E.M. Reingold
,
D.A. Plaisted
SIAM Journal on Computing
12
(1), 1983, February, pp. 144-156
The application of multivariate polynomials to inference rules and partial tests for unsatisfiability
D.A. Plaisted
SIAM Journal on Computing
9
(4), 1980, November, pp. 698-705
On the distribution of independent formulae of number theory
D.A. Plaisted
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 39-44
Heuristics for weighted perfect matching
K.J. Supowit
,
D.A. Plaisted
,
E.M. Reingold
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 398-419
Fast verification, testing, and generation of large primes
D.A. Plaisted
Theoretical Computer Science
9
(1), 1979, pp. 1-16
Some polynomial and integer divisibility problems are
NP
-hard
D. Plaisted
SIAM Journal on Computing
7
(4), 1978, November, pp. 458-464
Sparse complex polynomials and polynomial reducibility
D.A. Plaisted
Journal of Computer and System Sciences
14
(2), 1977, April, pp. 210-221
New
NP
-hard and
NP
-complete polynomial and integer divisibility problems
D.A. Plaisted
Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, FOCS'77 (Providence, RI, October 31 - November 2, 1977)
, 1977, pp. 241-253
Some polynomial and integer divisibility problems are
NP
-hard
D.A. Plaisted
Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, FOCS'76 (Houston, TX, October 25-27, 1976)
, 1976, pp. 264-267
Flowchart schemata with counters
D.A. Plaisted
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, STOC'72 (Denver, CO, May 1-3, 1972)
, 1972, pp. 44-51