Creative telescoping for rational functions using the griffiths: dwork method. - Alin Bostan; Pierre Lairez; Bruno Salvy (ISSAC, 2013)

Périodes d'intégrales rationnelles : algorithmes et applications. (Periods of rational integrals : algorithms and applications). - Pierre Lairez (2014)

Computing the Chow Variety of Quadratic Space Curves. - Peter Bürgisser; Kathlén Kohn; Pierre Lairez; Bernd Sturmfels (MACIS, 2015)

On p-Adic Differential Equations with Separation of Variables. - Pierre Lairez; Tristan Vaccon (ISSAC, 2016)

Computing periods of rational integrals. - Pierre Lairez (Math. Comput., 2016)

Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems. - Pierre Lairez (CoRR, 2017)

A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time. - Pierre Lairez (Found. Comput. Math., 2017)

Multiple binomial sums. - Alin Bostan; Pierre Lairez; Bruno Salvy (J. Symb. Comput., 2017)

Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions. - Alin Bostan; Frédéric Chyzak; Pierre Lairez; Bruno Salvy (ISSAC, 2018)

Computing the Volume of Compact Semi-Algebraic Sets. - Pierre Lairez; Marc Mezzarobba; Mohab Safey El Din (ISSAC, 2019)

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time. - Peter Bürgisser; Felipe Cucker; Pierre Lairez (J. ACM, 2019)

A Numerical Transcendental Method in Algebraic Geometry: Computation of Picard Groups and Related Invariants. - Pierre Lairez; Emre Can Sertöz (SIAM J. Appl. Algebra Geom., 2019)

The Sage package comb_walks for walks in the quarter plane. - Antonio Jiménez-Pastor; Alin Bostan; Frédéric Chyzak; Pierre Lairez (ACM Commun. Comput. Algebra, 2020)

Rigid continuation paths II. Structured polynomial systems. - Peter Bürgisser; Felipe Cucker; Pierre Lairez (CoRR, 2020)

Computing the Dimension of Real Algebraic Sets. - Pierre Lairez; Mohab Safey El Din (ISSAC, 2021)

Computing the dimension of a real algebraic set. - Pierre Lairez; Mohab Safey El Din (CoRR, 2021)

Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system. - Christian Eder; Pierre Lairez; Rafael Mohr; Mohab Safey El Din (ACM Commun. Comput. Algebra, 2022)

A Direttissimo Algorithm for Equidimensional Decomposition. - Christian Eder; Pierre Lairez; Rafael Mohr; Mohab Safey El Din (ISSAC, 2023)

Effective homology and periods of complex projective hypersurfaces. - Pierre Lairez; Eric Pichon-Pharabod; Pierre Vanhove (CoRR, 2023)

A signature-based algorithm for computing the nondegenerate locus of a polynomial system. - Christian Eder; Pierre Lairez; Rafael Mohr; Mohab Safey El Din (J. Symb. Comput., 2023)

Foreword. - Anton Leykin; Pierre Lairez (J. Symb. Comput., 2023)

Validated Numerics for Algebraic Path Tracking. - Alexandre Guillemot; Pierre Lairez (ISSAC, 2024)

Transcendental methods in numerical algebraic geometry. - Pierre Lairez (ISSAC, 2024)

Conway's cosmological theorem and automata theory. - Pierre Lairez; Aleksandr Storozhenko (CoRR, 2024)

Axioms for a theory of signature bases. - Pierre Lairez (J. Symb. Comput., 2024)

Faster multivariate integration in D-modules. - Hadrien Brochet; Frédéric Chyzak; Pierre Lairez (CoRR, 2025)