André Galligo

Affiliations:
  • University of Nice Sophia Antipolis, Nice, France


According to our database1, André Galligo authored at least 59 papers between 1985 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Certified Study of Internal Solitary Waves.
Proceedings of the Computer Algebra in Scientific Computing - 25th International Workshop, 2023

2022
Modeling Complex Root Motion of Real Random Polynomials under Differentiation.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
Spirometry-Based Airways Disease Simulation and Recognition Using Machine Learning Approaches.
Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

2017
On mixed polynomials of bidegree (n, 1).
Theor. Comput. Sci., 2017

Extraction of tori from minimal point sets.
Comput. Aided Geom. Des., 2017

2016
Extraction of cylinders and cones from minimal point sets.
Graph. Model., 2016

2015
Explicit form of parametric polynomial minimal surfaces with arbitrary degree.
Appl. Math. Comput., 2015

Computer Algebra Applied to a Solitary Waves Study.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
Corrigendum to "Constructing analysis-suitable parameterization of computational domain from CAD boundary by variational harmonic method" [J. Comput. Phys. 252(2013) 275-289].
J. Comput. Phys., 2014

Exploring univariate mixed polynomials.
Proceedings of the Symbolic-Numeric Computation 2014, 2014

2013
Budan tables of real univariate polynomials.
J. Symb. Comput., 2013

Deformation of roots of polynomials via fractional derivatives.
J. Symb. Comput., 2013

Constructing analysis-suitable parameterization of computational domain from CAD boundary by variational harmonic method.
J. Comput. Phys., 2013

Optimal analysis-aware parameterization of computational domain in 3D isogeometric analysis.
Comput. Aided Des., 2013

Analysis-suitable volume parameterization of multi-block computational domain in isogeometric applications.
Comput. Aided Des., 2013

2012
On the cut-off phenomenon for the transitivity of randomly generated subgroups.
Random Struct. Algorithms, 2012

Approximate GCD of several univariate polynomials with small degree perturbations.
J. Symb. Comput., 2012

A root isolation algorithm for sparse univariate polynomials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
Computing monodromy via continuation methods on random Riemann surfaces.
Theor. Comput. Sci., 2011

A subdivision method for computing nearest gcd with certification.
Theor. Comput. Sci., 2011

A construction of injective parameterizations of domains for isogeometric applications.
Proceedings of the SNC 2011, 2011

Roots of the derivatives of some random polynomials.
Proceedings of the SNC 2011, 2011

Virtual roots of a real polynomial and fractional derivatives.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Variational Harmonic Method for Parameterization of Computational Domain in 2D Isogeometric Analysis.
Proceedings of the 12th International Conference on Computer-Aided Design and Computer Graphics, 2011

2010
Modular Las Vegas algorithms for polynomial absolute factorization.
J. Symb. Comput., 2010

Random polynomials and expected complexity of bisection methods for real solving.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis.
Proceedings of the Advances in Geometric Modeling and Processing, 2010

2009
Effective methods in algebraic geometry.
J. Symb. Comput., 2009

Towards toric absolute factorization.
J. Symb. Comput., 2009

A computational study of ruled surfaces.
J. Symb. Comput., 2009

Probabilistic algorithms for polynomial absolute factorization.
ACM Commun. Comput. Algebra, 2009

Continuations and monodromy on random riemann surfaces.
Proceedings of the Symbolic Numeric Computation, 2009

Computing nearest Gcd with certification.
Proceedings of the Symbolic Numeric Computation, 2009

2008
Preface.
Theor. Comput. Sci., 2008

Absolute factoring of bidegree bivariate polynomials.
ACM Commun. Comput. Algebra, 2008

Intersection and self-intersection of surfaces by means of Bezoutian matrices.
Comput. Aided Geom. Des., 2008

2007
On the geometry of parametrized bicubic surfaces.
J. Symb. Comput., 2007

Approximate bivariate factorization: a geometric viewpoint.
Proceedings of the Symbolic-Numeric Computation, 2007

Systems of three polynomials with two separated variables.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006
From an approximate to an exact absolute polynomial factorization.
J. Symb. Comput., 2006

A sampling algorithm computing self-intersections of parametric surfaces.
Proceedings of the Algebraic Geometry and Geometric Modeling, 2006

On parametric surfaces of low degree in P<sup>3</sup>(C).
Proceedings of the Algebraic Geometry and Geometric Modeling, 2006

2005
Semi-implicit representations of surfaces in , resultants and applications.
J. Symb. Comput., 2005

Selfintersections of a bézier bicubic surface.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
Using Semi-Implicit Representation of Algebraic Surfaces.
Proceedings of the 2004 International Conference on Shape Modeling and Applications (SMI 2004), 2004

Parametrized surfaces in huge P<sup>3</sup> of bidegree(1,2).
Proceedings of the Symbolic and Algebraic Computation, 2004

2002
Irreducible Decomposition of Curves.
J. Symb. Comput., 2002

A geometric-numeric algorithm for absolute factorization of multivariate polynomials.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
Semi-numerical determination of irreducible branches of a reduced space curve.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

1997
A Numerical Absolute Primality Test for Bivariate Polynomials.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996
Book Review: Polynomial and Matrix Computations Volume 1: Fundamental Algorithms by D. Bini and V. Pan.
SIGSAM Bull., 1996

1995
Complexity of Finding Irreducible Components of a Semialgebraic Set.
J. Complex., 1995

1992
The Extensions of the Sisyphe Computer Algebra System: ulysse and athena.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1992

1991
Equations for the projective closure and effective Nullstellensatz.
Discret. Appl. Math., 1991

1990
The design of SISYPHE: a system for doing symbolic and algebraic computations.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

1989
Practical Determination of the Dimension of an Algebraic Variety.
Proceedings of the Computers and Mathematics, 1989

1988
Greater Easy Common Divisor and Standard Basis Completion Algorithms.
Proceedings of the Symbolic and Algebraic Computation, 1988

Some New Effectivity Bounds in Computational Geometry.
Proceedings of the Applied Algebra, 1988

1985
Some Algorithmic Questions of Constructing Standard Bases.
Proceedings of the EUROCAL '85, 1985


  Loading...