Adrien Poteaux

From MaRDI portal
Person:371189

Available identifiers

zbMath Open poteaux.adrienMaRDI QIDQ371189

List of research outcomes





PublicationDate of PublicationType
Local polynomial factorisation. Improving the montes algorithm2025-01-17Paper
Fast integral bases computation2025-01-10Paper
Algorithm for Connectivity Queries on Real Algebraic Curves2023-11-03Paper
Validated Root Enclosures for Interval Polynomials with Multiplicities2023-11-03Paper
Polynomial factorization over henselian fields2022-07-05Paper
[[Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]2022-06-27Paper
Decoupling multivariate fractions2022-03-24Paper
Computing Puiseux series: a fast divide and conquer algorithm2022-02-24Paper
A short contribution to the theory of regular chains2021-06-25Paper
Computing the equisingularity type of a pseudo-irreducible polynomial2021-05-14Paper
A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays2020-07-03Paper
[[Publication:6316448|Using approximate roots for irreducibility and equi-singularity issues in Kx[y]]]2019-03-30Paper
An equivalence theorem for regular differential chains2019-03-21Paper
Symbolic-numeric methods for nonlinear integro-differential modeling2018-10-23Paper
Death of Marc Rybowicz, aged 522017-06-21Paper
Continuations and monodromy on random riemann surfaces2017-02-03Paper
Improving complexity bounds for the computation of Puiseux series over finite fields2016-09-29Paper
Almost linear time operations with triangular sets2015-02-20Paper
Connectivity queries on curves in Rn2015-02-20Paper
An Algorithm for Converting Nonlinear Differential Equations to Integral Equations with an Application to Parameter Estimation from Noisy Data2014-09-08Paper
Modular composition modulo triangular sets and applications2013-09-30Paper
On the complexity of computing with zero-dimensional triangular sets2013-01-10Paper
Approximate Implicitization of Space Curves2012-09-14Paper
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields2012-06-20Paper
Good reduction of Puiseux series and applications2011-12-21Paper
Computing monodromy via continuation methods on random Riemann surfaces2011-03-29Paper
Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields2009-01-20Paper

Research outcomes over time

This page was built for person: Adrien Poteaux