 | 2012 |
| 34 |  | Mohamed Elkadi,
André Galligo,
Thang Luu Ba:
Approximate GCD of several univariate polynomials with small degree perturbations.
J. Symb. Comput. 47(4): 410-421 (2012) |
| 33 |  | André Galligo,
Laurent Miclo:
On the cut-off phenomenon for the transitivity of randomly generated subgroups.
Random Struct. Algorithms 40(2): 182-219 (2012) |
| 2011 |
| 32 |  | Gang Xu,
Bernard Mourrain,
Régis Duvigneau,
André Galligo:
Variational Harmonic Method for Parameterization of Computational Domain in 2D Isogeometric Analysis.
CAD/Graphics 2011: 223-228 |
| 31 |  | Daniel Bembé,
André Galligo:
Virtual roots of a real polynomial and fractional derivatives.
ISSAC 2011: 27-34 |
| 30 |  | André Galligo,
Adrien Poteaux:
Computing monodromy via continuation methods on random Riemann surfaces.
Theor. Comput. Sci. 412(16): 1492-1507 (2011) |
| 29 |  | Guillaume Chèze,
André Galligo,
Bernard Mourrain,
Jean-Claude Yakoubsohn:
A subdivision method for computing nearest gcd with certification.
Theor. Comput. Sci. 412(35): 4493-4503 (2011) |
| 2010 |
| 28 |  | Gang Xu,
Bernard Mourrain,
Régis Duvigneau,
André Galligo:
Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis.
GMP 2010: 236-254 |
| 27 |  | Ioannis Z. Emiris,
André Galligo,
Elias P. Tsigaridas:
Random polynomials and expected complexity of bisection methods for real solving.
ISSAC 2010: 235-242 |
| 26 |  | Ioannis Z. Emiris,
André Galligo,
Elias P. Tsigaridas:
Random polynomials and expected complexity of bisection methods for real solving
CoRR abs/1005.2001: (2010) |
| 25 |  | Cristina Bertone,
Guillaume Chèze,
André Galligo:
Modular Las Vegas algorithms for polynomial absolute factorization.
J. Symb. Comput. 45(12): 1280-1295 (2010) |
| 2009 |
| 24 |  | Laurent Busé,
Mohamed Elkadi,
André Galligo:
A computational study of ruled surfaces.
J. Symb. Comput. 44(3): 232-241 (2009) |
| 23 |  | André Galligo,
Luis Miguel Pardo,
Josef Schicho:
Effective methods in algebraic geometry.
J. Symb. Comput. 44(9): 1087-1088 (2009) |
| 22 |  | Mohamed Elkadi,
André Galligo,
M. Weimann:
Towards toric absolute factorization.
J. Symb. Comput. 44(9): 1194-1211 (2009) |
| 2008 |
| 21 |  | Laurent Busé,
Mohamed Elkadi,
André Galligo:
Intersection and self-intersection of surfaces by means of Bezoutian matrices.
Computer Aided Geometric Design 25(2): 53-68 (2008) |
| 20 |  | André Galligo:
Preface.
Theor. Comput. Sci. 392(1-3): 3-4 (2008) |
| 2007 |
| 19 |  | Mohamed Elkadi,
André Galligo:
Systems of three polynomials with two separated variables.
ISSAC 2007: 159-166 |
| 18 |  | André Galligo,
Mark van Hoeij:
Approximate bivariate factorization: a geometric viewpoint.
SNC 2007: 1-10 |
| 17 |  | André Galligo,
Michael Stillman:
On the geometry of parametrized bicubic surfaces.
J. Symb. Comput. 42(1-2): 136-158 (2007) |
| 2006 |
| 16 |  | Guillaume Chèze,
André Galligo:
From an approximate to an exact absolute polynomial factorization.
J. Symb. Comput. 41(6): 682-696 (2006) |
| 2005 |
| 15 |  | André Galligo,
Jean Pascal Pavone:
Selfintersections of a bézier bicubic surface.
ISSAC 2005: 148-155 |
| 14 |  | Laurent Busé,
André Galligo:
Semi-implicit representations of surfaces in , resultants and applications.
J. Symb. Comput. 39(3-4): 317-329 (2005) |
| 2004 |
| 13 |  | Mohamed Elkadi,
André Galligo,
Thi Ha Lê:
Parametrized surfaces in huge P3 of bidegree(1,2).
ISSAC 2004: 141-148 |
| 12 |  | Laurent Busé,
André Galligo:
Using Semi-Implicit Representation of Algebraic Surfaces.
SMI 2004: 342-345 |
| 2002 |
| 11 |  | Robert M. Corless,
André Galligo,
Ilias S. Kotsireas,
Stephen M. Watt:
A geometric-numeric algorithm for absolute factorization of multivariate polynomials.
ISSAC 2002: 37-45 |
| 10 |  | André Galligo,
David Rupprecht:
Irreducible Decomposition of Curves.
J. Symb. Comput. 33(5): 661-677 (2002) |
| 2001 |
| 9 |  | André Galligo,
David Rupprecht:
Semi-numerical determination of irreducible branches of a reduced space curve.
ISSAC 2001: 137-142 |
| 1997 |
| 8 |  | André Galligo,
Stephen M. Watt:
A Numerical Absolute Primality Test for Bivariate Polynomials.
ISSAC 1997: 217-224 |
| 1995 |
| 7 |  | André Galligo,
Nicolai Vorobjov:
Complexity of Finding Irreducible Components of a Semialgebraic Set.
J. Complexity 11(1): 174-193 (1995) |
| 1992 |
| 6 |  | C. Faure,
André Galligo,
J. Grimm,
Loic Pottier:
The Extensions of the Sisyphe Computer Algebra System: ulysse and athena.
DISCO 1992: 44-55 |
| 1991 |
| 5 |  | Leandro Caniglia,
André Galligo,
Joos Heintz:
Equations for the projective closure and effective Nullstellensatz.
Discrete Applied Mathematics 33(1-3): 11-23 (1991) |
| 1990 |
| 4 |  | André Galligo,
J. Grimm,
Loic Pottier:
The design of SISYPHE: a system for doing symbolic and algebraic computations.
DISCO 1990: 30-39 |
| 1988 |
| 3 |  | Leandro Caniglia,
André Galligo,
Joos Heintz:
Some New Effectivity Bounds in Computational Geometry.
AAECC 1988: 131-151 |
| 2 |  | André Galligo,
Loic Pottier,
Carlo Traverso:
Greater Easy Common Divisor and Standard Basis Completion Algorithms.
ISSAC 1988: 162-176 |
| 1985 |
| 1 |  | André Galligo:
Some Algorithmic Questions of Constructing Standard Bases.
European Conference on Computer Algebra (2) 1985: 413-421 |