default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Galligo
Person information
- affiliation: University of Nice Sophia Antipolis, Nice, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c28]André Galligo, Didier Clamond:
Certified Study of Internal Solitary Waves. CASC 2023: 90-106- 2022
- [c27]André Galligo:
Modeling Complex Root Motion of Real Random Polynomials under Differentiation. ISSAC 2022: 245-253 - [i4]André Galligo:
Modeling complex root motion of real random polynomials under differentiation. CoRR abs/2205.08747 (2022) - 2021
- [c26]Riccardo Dio, André Galligo, Angelos Mantzaflaris
, Benjamin Mauroy:
Spirometry-Based Airways Disease Simulation and Recognition Using Machine Learning Approaches. LION 2021: 98-112 - [i3]Riccardo Dio, André Galligo, Angelos Mantzaflaris, Benjamin Mauroy:
Spirometry-based airways disease simulation and recognition using Machine Learning approaches. CoRR abs/2111.04315 (2021)
2010 – 2019
- 2017
- [j29]Laurent Busé, André Galligo:
Extraction of tori from minimal point sets. Comput. Aided Geom. Des. 58: 1-7 (2017) - [j28]Mohamed Elkadi, André Galligo:
On mixed polynomials of bidegree (n, 1). Theor. Comput. Sci. 681: 41-53 (2017) - 2016
- [j27]Laurent Busé, André Galligo, Jiajun Zhang:
Extraction of cylinders and cones from minimal point sets. Graph. Model. 86: 1-12 (2016) - [i2]Laurent Busé, André Galligo, Jiajun Zhang:
Extraction of cylinders and cones from minimal point sets. CoRR abs/1603.04582 (2016) - 2015
- [j26]Gang Xu, Yaguang Zhu, Guozhao Wang, André Galligo, Li Zhang, Kin-Chuen Hui:
Explicit form of parametric polynomial minimal surfaces with arbitrary degree. Appl. Math. Comput. 259: 124-131 (2015) - [c25]Didier Clamond, Denys Dutykh, André Galligo:
Computer Algebra Applied to a Solitary Waves Study. ISSAC 2015: 125-132 - 2014
- [j25]Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo:
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. 272: 865 (2014) - [c24]Mohamed Elkadi, André Galligo:
Exploring univariate mixed polynomials. SNC 2014: 50-58 - 2013
- [j24]Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo:
Analysis-suitable volume parameterization of multi-block computational domain in isogeometric applications. Comput. Aided Des. 45(2): 395-404 (2013) - [j23]Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo:
Optimal analysis-aware parameterization of computational domain in 3D isogeometric analysis. Comput. Aided Des. 45(4): 812-821 (2013) - [j22]Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo:
Constructing analysis-suitable parameterization of computational domain from CAD boundary by variational harmonic method. J. Comput. Phys. 252: 275-289 (2013) - [j21]André Galligo:
Deformation of roots of polynomials via fractional derivatives. J. Symb. Comput. 52: 35-50 (2013) - [j20]André Galligo:
Budan tables of real univariate polynomials. J. Symb. Comput. 53: 64-80 (2013) - 2012
- [j19]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) - [j18]André Galligo, Laurent Miclo:
On the cut-off phenomenon for the transitivity of randomly generated subgroups. Random Struct. Algorithms 40(2): 182-219 (2012) - [c23]Maria Emilia Alonso Garcia, André Galligo:
A root isolation algorithm for sparse univariate polynomials. ISSAC 2012: 35-42 - 2011
- [j17]André Galligo, Adrien Poteaux:
Computing monodromy via continuation methods on random Riemann surfaces. Theor. Comput. Sci. 412(16): 1492-1507 (2011) - [j16]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) - [c22]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 - [c21]Daniel Bembé, André Galligo:
Virtual roots of a real polynomial and fractional derivatives. ISSAC 2011: 27-34 - [c20]André Galligo:
Roots of the derivatives of some random polynomials. SNC 2011: 122-129 - [c19]Thien Nguyen, Bernard Mourrain, André Galligo, Gang Xu:
A construction of injective parameterizations of domains for isogeometric applications. SNC 2011: 149-150 - 2010
- [j15]Cristina Bertone, Guillaume Chèze, André Galligo:
Modular Las Vegas algorithms for polynomial absolute factorization. J. Symb. Comput. 45(12): 1280-1295 (2010) - [c18]Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo:
Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis. GMP 2010: 236-254 - [c17]Ioannis Z. Emiris, André Galligo, Elias P. Tsigaridas:
Random polynomials and expected complexity of bisection methods for real solving. ISSAC 2010: 235-242 - [i1]Ioannis Z. Emiris, André Galligo, Elias P. Tsigaridas:
Random polynomials and expected complexity of bisection methods for real solving. CoRR abs/1005.2001 (2010)
2000 – 2009
- 2009
- [j14]Cristina Bertone, Guillaume Chèze, André Galligo:
Probabilistic algorithms for polynomial absolute factorization. ACM Commun. Comput. Algebra 43(3/4): 77-78 (2009) - [j13]Laurent Busé, Mohamed Elkadi, André Galligo:
A computational study of ruled surfaces. J. Symb. Comput. 44(3): 232-241 (2009) - [j12]André Galligo, Luis Miguel Pardo, Josef Schicho:
Effective methods in algebraic geometry. J. Symb. Comput. 44(9): 1087-1088 (2009) - [j11]Mohamed Elkadi, André Galligo, Martin Weimann:
Towards toric absolute factorization. J. Symb. Comput. 44(9): 1194-1211 (2009) - [c16]Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain:
Computing nearest Gcd with certification. SNC 2009: 29-34 - [c15]André Galligo, Adrien Poteaux:
Continuations and monodromy on random riemann surfaces. SNC 2009: 115-124 - 2008
- [j10]Laurent Busé, Mohamed Elkadi, André Galligo:
Intersection and self-intersection of surfaces by means of Bezoutian matrices. Comput. Aided Geom. Des. 25(2): 53-68 (2008) - [j9]Guillaume Chèze, Mohamed Elkadi, André Galligo, Martin Weimann:
Absolute factoring of bidegree bivariate polynomials. ACM Commun. Comput. Algebra 42(3): 151-153 (2008) - [j8]André Galligo:
Preface. Theor. Comput. Sci. 392(1-3): 3-4 (2008) - 2007
- [j7]André Galligo, Michael Eugene Stillman:
On the geometry of parametrized bicubic surfaces. J. Symb. Comput. 42(1-2): 136-158 (2007) - [c14]André Galligo, Mark van Hoeij:
Approximate bivariate factorization: a geometric viewpoint. SNC 2007: 1-10 - [c13]Mohamed Elkadi, André Galligo:
Systems of three polynomials with two separated variables. ISSAC 2007: 159-166 - 2006
- [j6]Guillaume Chèze, André Galligo:
From an approximate to an exact absolute polynomial factorization. J. Symb. Comput. 41(6): 682-696 (2006) - [p2]Mohamed Elkadi, André Galligo, Thi Ha Lê:
On parametric surfaces of low degree in P3(C). Algebraic Geometry and Geometric Modeling 2006: 151-168 - [p1]André Galligo, Jean Pascal Pavone:
A sampling algorithm computing self-intersections of parametric surfaces. Algebraic Geometry and Geometric Modeling 2006: 185-204 - 2005
- [j5]Laurent Busé, André Galligo:
Semi-implicit representations of surfaces in , resultants and applications. J. Symb. Comput. 39(3-4): 317-329 (2005) - [c12]André Galligo, Jean Pascal Pavone:
Selfintersections of a bézier bicubic surface. ISSAC 2005: 148-155 - 2004
- [c11]Mohamed Elkadi, André Galligo, Thi Ha Lê:
Parametrized surfaces in huge P3 of bidegree(1,2). ISSAC 2004: 141-148 - [c10]Laurent Busé, André Galligo:
Using Semi-Implicit Representation of Algebraic Surfaces. SMI 2004: 342-345 - 2002
- [j4]André Galligo, David Rupprecht:
Irreducible Decomposition of Curves. J. Symb. Comput. 33(5): 661-677 (2002) - [c9]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 - 2001
- [c8]André Galligo, David Rupprecht:
Semi-numerical determination of irreducible branches of a reduced space curve. ISSAC 2001: 137-142
1990 – 1999
- 1997
- [c7]André Galligo, Stephen M. Watt:
A Numerical Absolute Primality Test for Bivariate Polynomials. ISSAC 1997: 217-224 - 1996
- [j3]Ioannis Z. Emiris, André Galligo:
Book Review: Polynomial and Matrix Computations Volume 1: Fundamental Algorithms by D. Bini and V. Pan. SIGSAM Bull. 30(3): 21-23 (1996) - 1995
- [j2]André Galligo, Nicolai N. Vorobjov Jr.:
Complexity of Finding Irreducible Components of a Semialgebraic Set. J. Complex. 11(1): 174-193 (1995) - 1992
- [c6]C. Faure, André Galligo, J. Grimm, Loic Pottier:
The Extensions of the Sisyphe Computer Algebra System: ulysse and athena. DISCO 1992: 44-55 - 1991
- [j1]Leandro Caniglia, André Galligo, Joos Heintz:
Equations for the projective closure and effective Nullstellensatz. Discret. Appl. Math. 33(1-3): 11-23 (1991) - 1990
- [c5]André Galligo, J. Grimm, Loic Pottier:
The design of SISYPHE: a system for doing symbolic and algebraic computations. DISCO 1990: 30-39
1980 – 1989
- 1989
- [c4]André Galligo, Carlo Traverso:
Practical Determination of the Dimension of an Algebraic Variety. Computers and Mathematics 1989: 46-52 - 1988
- [c3]Leandro Caniglia, André Galligo, Joos Heintz:
Some New Effectivity Bounds in Computational Geometry. AAECC 1988: 131-151 - [c2]André Galligo, Loic Pottier, Carlo Traverso:
Greater Easy Common Divisor and Standard Basis Completion Algorithms. ISSAC 1988: 162-176 - 1985
- [c1]André Galligo:
Some Algorithmic Questions of Constructing Standard Bases. European Conference on Computer Algebra (2) 1985: 413-421
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
