Adrien Poteaux

Orcid: 0000-0002-7493-3001

According to our database1, Adrien Poteaux authored at least 24 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Algorithm for Connectivity Queries on Real Algebraic Curves.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Validated Root Enclosures for Interval Polynomials with Multiplicities.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
A quasi-linear irreducibility test in 핂[[x]][y].
Comput. Complex., 2022

Local Polynomial Factorisation: Improving the Montes Algorithm.
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.
Math. Comput. Sci., 2021

Decoupling Multivariate Fractions.
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020
Computing the equisingularity type of a pseudo-irreducible polynomial.
Appl. Algebra Eng. Commun. Comput., 2020

2019
An equivalence theorem for regular differential chains.
J. Symb. Comput., 2019

2018
Symbolic-Numeric Methods for Nonlinear Integro-Differential Modeling.
Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2016
Death of Marc Rybowicz, aged 52.
ACM Commun. Comput. Algebra, 2016

2015
Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields.
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.
Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013
On the complexity of computing with zero-dimensional triangular sets.
J. Symb. Comput., 2013

Modular Composition Modulo Triangular Sets and Applications.
Comput. Complex., 2013

2012
Good reduction of Puiseux series and applications.
J. Symb. Comput., 2012

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

Connectivity queries on curves in Rn.
ACM Commun. Comput. Algebra, 2011

Complexity bounds for the rational Newton-Puiseux algorithm over finite fields.
Appl. Algebra Eng. Commun. Comput., 2011

2010
Almost linear time operations with triangular sets.
ACM Commun. Comput. Algebra, 2010

Hierarchical Spline Approximation of the Signed Distance Function.
Proceedings of the SMI 2010, 2010

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

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

Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Computing monodromy groups defined by plane algebraic curves.
Proceedings of the Symbolic-Numeric Computation, 2007


  Loading...