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="Bajaj, Chanderjit"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Convex decomposition of polyhedra and robustness
Chanderjit L. Bajaj
,
Tamal K. Dey
SIAM Journal on Computing
21
(2), 1992, April, pp. 339-364
Convex hulls of objects bounded by algebraic curves
Chanderjit Bajaj
,
Myung-Soo Kim
Algorithmica
6
(4), 1991, pp. 533-553
Sorting points along an algebraic curve
John K. Johnstone
,
Chanderjit L. Bajaj
SIAM Journal on Computing
19
, 1990, pp. 925-967
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
Robust decompositions of polyhedra
Chanderjit L. Bajaj
,
Tamal K. Dey
Lecture Notes in Computer Science
405
, 1989, pp. 267-279
Generation of configuration space obstacles: The case of moving algebraic curves
Chanderjit L. Bajaj
,
Myung-Soo Kim
Algorithmica
4
, 1989, pp. 157-172
Proving geometric algorithm non-solvability: An application of factoring polynomials
Chanderjit Bajaj
Journal Symbolic Computation
2
(1), 1986, pp. 99-102