Adrien Poteaux

Proceedings of the Computer Algebra in Scientific Computing - 26th International Workshop, 2024

2023

Algorithm for Connectivity Queries on Real Algebraic Curves.

[BibT_eX]

[DOI]

Md. Nazrul Islam

Rémi Prébet

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Validated Root Enclosures for Interval Polynomials with Multiplicities.

[BibT_eX]

[DOI]

Florent Bréhard

Léo Soudant

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022

A quasi-linear irreducibility test in 핂[[x]][y].

[BibT_eX]

[DOI]

Comput. Complex., 2022

Local Polynomial Factorisation: Improving the Montes Algorithm.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

A Short Contribution to the Theory of Regular Chains.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2021

Decoupling Multivariate Fractions.

[BibT_eX]

[DOI]

François Lemaire

Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020

Computing the equisingularity type of a pseudo-irreducible polynomial.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2020

2019

An equivalence theorem for regular differential chains.

[BibT_eX]

[DOI]

J. Symb. Comput., 2019

2018

Symbolic-Numeric Methods for Nonlinear Integro-Differential Modeling.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2016

Death of Marc Rybowicz, aged 52.

[BibT_eX]

[DOI]

Dominique Duval

ACM Commun. Comput. Algebra, 2016

2015

Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

An Algorithm for Converting Nonlinear Differential Equations to Integral Equations with an Application to Parameter Estimation from Noisy Data.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013

On the complexity of computing with zero-dimensional triangular sets.

[BibT_eX]

[DOI]

Éric Schost

J. Symb. Comput., 2013

Modular Composition Modulo Triangular Sets and Applications.

[BibT_eX]

[DOI]

Éric Schost

Comput. Complex., 2013

2012

Good reduction of Puiseux series and applications.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

2011

Computing monodromy via continuation methods on random Riemann surfaces.

[BibT_eX]

[DOI]

André Galligo

Theor. Comput. Sci., 2011

Connectivity queries on curves in Rn.

[BibT_eX]

[DOI]

Md. Nazrul Islam

ACM Commun. Comput. Algebra, 2011

Complexity bounds for the rational Newton-Puiseux algorithm over finite fields.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2011

2010

Almost linear time operations with triangular sets.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2010

Hierarchical Spline Approximation of the Signed Distance Function.

[BibT_eX]

[DOI]

Xinghua Song

Bert Jüttler

Proceedings of the SMI 2010, 2010

2009

Continuations and monodromy on random riemann surfaces.

[BibT_eX]

[DOI]

André Galligo

Proceedings of the Symbolic Numeric Computation, 2009

2008

Towards a Symbolic-Numeric Method to Compute Puiseux Series: The Modular Part

[BibT_eX]

[DOI]

CoRR, 2008

Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

Computing monodromy groups defined by plane algebraic curves.

[BibT_eX]

[DOI]