Pierre Lairez

Orcid: 0000-0003-3756-0151

According to our database1, Pierre Lairez authored at least 23 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Axioms for a theory of signature bases.
J. Symb. Comput., July, 2024

Validated numerics for algebraic path tracking.
CoRR, 2024

2023
Foreword.
J. Symb. Comput., 2023

A signature-based algorithm for computing the nondegenerate locus of a polynomial system.
J. Symb. Comput., 2023

Effective homology and periods of complex projective hypersurfaces.
CoRR, 2023

A Direttissimo Algorithm for Equidimensional Decomposition.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system.
ACM Commun. Comput. Algebra, 2022

2021
Computing the dimension of a real algebraic set.
CoRR, 2021

Computing the Dimension of Real Algebraic Sets.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Rigid continuation paths II. Structured polynomial systems.
CoRR, 2020

The Sage package comb_walks for walks in the quarter plane.
ACM Commun. Comput. Algebra, 2020

2019
A Numerical Transcendental Method in Algebraic Geometry: Computation of Picard Groups and Related Invariants.
SIAM J. Appl. Algebra Geom., 2019

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time.
J. ACM, 2019

Computing the Volume of Compact Semi-Algebraic Sets.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
Multiple binomial sums.
J. Symb. Comput., 2017

A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time.
Found. Comput. Math., 2017

Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems.
CoRR, 2017

2016
Computing periods of rational integrals.
Math. Comput., 2016

On p-Adic Differential Equations with Separation of Variables.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Computing the Chow Variety of Quadratic Space Curves.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014
Périodes d'intégrales rationnelles : algorithmes et applications. (Periods of rational integrals : algorithms and applications).
PhD thesis, 2014

2013
Creative telescoping for rational functions using the griffiths: dwork method.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013


  Loading...