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"
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
A practical algorithm for geometric theorem proving
Ashutosh Rege
,
John Canny
Lecture Notes in Computer Science
958
, 1995, pp. 10-17
Geometric problems in molecular biology and robotics
David Parsons
,
John Canny
Proceedings of the 2nd International Conference on Intelligent Systems for Molecular Biology, ISMB'94 (Stanford, CA, USA, August 14-17, 1994)
, 1994, pp. 322-330
Factoring rational polynomials over the complex numbers
Chanderjit Bajaj
,
John Canny
,
Thomas Garrity
,
Joe Warren
SIAM Journal on Computing
22
(2), 1993, April, pp. 318-331
An efficient algorithm for the sparse mixed resultant
John Canny
,
Ioannis Emiris
Lecture Notes in Computer Science
673
, 1993, pp. 89-104
An opportunistic global path planner
John F. Canny
,
Ming C. Lin
Algorithmica
10
, 1993, pp. 102-120
Kinodynamic motion planning
Bruce Donald
,
Patrick Xavier
,
John Canny
,
John Reif
Journal of the ACM
40
(5), 1993, November, pp. 1048-1066
A practical method for the sparse resultant
Ioannis Emiris
,
John Canny
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, ISSAC'93 (Kiev, Ukraine, July 6-8, 1993)
, 1993, pp. 183-192
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
An optimal condition for determining the exact number of roots of a polynomial system
John Canny
,
J. Maurice Rojas
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC'91 (Bonn, Germany, July 15-17, 1991)
, 1991, pp. 96-102
A general approach to removing degeneracies
Ioannis Emiris
,
John Canny
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 405-413
Efficient techniques for multipolynomial resultant algorithms
Dinesh Manocha
,
John Canny
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC'91 (Bonn, Germany, July 15-17, 1991)
, 1991, pp. 86-95
Generalised characteristic polynomials
John Canny
Journal Symbolic Computation
9
(3), 1990, pp. 241-250
Factoring rational polynomials over the complexes
Chanderjit Bajaj
,
John Canny
,
Thomas Garrity
,
Joe Warren
Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC'89 (Portland, Oregon, July 17-19, 1989)
, 1989, pp. 81-90
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
Some algebraic and geometric computations in PSPACE
John Canny
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 460-467