Search the dblp DataBase
André Galligo :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Leandro Caniglia , André Galligo , Joos Heintz Some New Effectivity Bounds in Computational Geometry. [Citation Graph (0, 0)][DBLP ] AAECC, 1988, pp:131-151 [Conf ] André Galligo , J. Grimm , Loic Pottier The design of SISYPHE: a system for doing symbolic and algebraic computations. [Citation Graph (0, 0)][DBLP ] DISCO, 1990, pp:30-39 [Conf ] C. Faure , André Galligo , J. Grimm , Loic Pottier The Extensions of the Sisyphe Computer Algebra System: ulysse and athena. [Citation Graph (0, 0)][DBLP ] DISCO, 1992, pp:44-55 [Conf ] André Galligo Some Algorithmic Questions of Constructing Standard Bases. [Citation Graph (0, 0)][DBLP ] European Conference on Computer Algebra (2), 1985, pp:413-421 [Conf ] Robert M. Corless , André Galligo , Ilias S. Kotsireas , Stephen M. Watt A geometric-numeric algorithm for absolute factorization of multivariate polynomials. [Citation Graph (0, 0)][DBLP ] ISSAC, 2002, pp:37-45 [Conf ] Mohamed Elkadi , André Galligo , Thi Ha Lê Parametrized surfaces in huge P3 of bidegree(1,2). [Citation Graph (0, 0)][DBLP ] ISSAC, 2004, pp:141-148 [Conf ] André Galligo , Jean Pascal Pavone Selfintersections of a bézier bicubic surface. [Citation Graph (0, 0)][DBLP ] ISSAC, 2005, pp:148-155 [Conf ] André Galligo , Loic Pottier , Carlo Traverso Greater Easy Common Divisor and Standard Basis Completion Algorithms. [Citation Graph (0, 0)][DBLP ] ISSAC, 1988, pp:162-176 [Conf ] André Galligo , David Rupprecht Semi-numerical determination of irreducible branches of a reduced space curve. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:137-142 [Conf ] André Galligo , Stephen M. Watt A Numerical Absolute Primality Test for Bivariate Polynomials. [Citation Graph (0, 0)][DBLP ] ISSAC, 1997, pp:217-224 [Conf ] Laurent Busé , André Galligo Using Semi-Implicit Representation of Algebraic Surfaces. [Citation Graph (0, 0)][DBLP ] SMI, 2004, pp:342-345 [Conf ] André Galligo , Nicolai Vorobjov Complexity of Finding Irreducible Components of a Semialgebraic Set. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1995, v:11, n:1, pp:174-193 [Journal ] Laurent Busé , André Galligo Semi-implicit representations of surfaces in , resultants and applications. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2005, v:39, n:3-4, pp:317-329 [Journal ] Guillaume Chèze , André Galligo From an approximate to an exact absolute polynomial factorization. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2006, v:41, n:6, pp:682-696 [Journal ] André Galligo , David Rupprecht Irreducible Decomposition of Curves. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2002, v:33, n:5, pp:661-677 [Journal ] André Galligo , Michael Stillman On the geometry of parametrized bicubic surfaces. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2007, v:42, n:1-2, pp:136-158 [Journal ] Mohamed Elkadi , André Galligo Systems of three polynomials with two separated variables. [Citation Graph (0, 0)][DBLP ] ISSAC, 2007, pp:159-166 [Conf ] Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis. [Citation Graph (, )][DBLP ] Approximate bivariate factorization: a geometric viewpoint. [Citation Graph (, )][DBLP ] Intersection and self-intersection of surfaces by means of Bezoutian matrices. [Citation Graph (, )][DBLP ] Random polynomials and expected complexity of bisection methods for real solving [Citation Graph (, )][DBLP ] Equations for the projective closure and effective Nullstellensatz. [Citation Graph (, )][DBLP ] Search in 0.038secs, Finished in 0.039secs