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="Canny, John F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A subdivision-based algorithm for the sparse resultant
John F. Canny
,
Ioannis Z. Emiris
Journal of the ACM
47
(3), 2000, pp. 417-451
Efficient incremental algorithms for the sparse resultant and the mixed volume
Ioannis Z. Emiris
,
John F. Canny
Journal Symbolic Computation
20
(2), 1995, pp. 117-149
A general approach to removing degeneracies
Ioannis Z. Emiris
,
John F. Canny
SIAM Journal on Computing
24
(3), 1995, pp. 650-664
An opportunistic global path planner
John F. Canny
,
Ming C. Lin
Algorithmica
10
, 1993, pp. 102-120
Multipolynomial resultant algorithms
Dinesh Manocha
,
John F. Canny
Journal Symbolic Computation
15
, 1993, pp. 99-122
Implicit representation of rational parametric surfaces
Dinesh Manocha
,
John F. Canny
Journal Symbolic Computation
13
(5), 1992, pp. 485-510
Multipolynomial resultants and linear algebra
Dinesh Manocha
,
John F. Canny
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC'92 (Berkeley, California, July 27-29, 1992)
, 1992, pp. 158-167
Solving systems of non-linear polynomial equations faster
John F. Canny
,
Erich Kaltofen
,
Yagati Lakshman
Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC'89 (Portland, Oregon, July 17-19, 1989)
, 1989, pp. 121-128