Xavier Dahan

Orcid: 0000-0001-6042-6132

According to our database1, Xavier Dahan authored at least 24 papers between 2004 and 2024.

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

2024
Faster bivariate lexicographic Groebner bases modulo x<sup>k</sup>.
Proceedings of the SCSS 2024 Work in Progress Workshop co-located with 10th International Symposium on Symbolic Computation in Software Science (SCSS 2024), 2024

2023
Chinese Remainder Theorem for bivariate lexicographic Gröbner bases.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one.
J. Symb. Comput., 2022

2020
Lexicographic Groebner bases of bivariate polynomials modulo a univariate one.
CoRR, 2020

On a non-archimedean broyden method.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2018
Computation of gcd chain over the power of an irreducible polynomial.
CoRR, 2018

2017
On the Bit-Size of Non-radical Triangular Sets.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Gcd Modulo a Primary Triangular Set of Dimension Zero.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
Bit-size reduction of triangular sets in two and three variables.
Proceedings of the 7th International Symposium on Symbolic Computation in Software Science, 2016

2015
Characterizing NTRU-Variants Using Group Ring and Evaluating their Lattice Security.
IACR Cryptol. ePrint Arch., 2015

MQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems.
IACR Cryptol. ePrint Arch., 2015

A multivariate quadratic challenge toward post-quantum generation cryptography.
ACM Commun. Comput. Algebra, 2015

2014
Regular graphs of large girth and arbitrary degree.
Comb., 2014

2012
Bit-size estimates for triangular sets in positive dimension.
J. Complex., 2012

On the structure of lexicographic Gröbner bases in dimension zero.
ACM Commun. Comput. Algebra, 2012

2011
Structure of lexicographic Groebner bases in three variables of ideals of dimension zero
CoRR, 2011

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

2009
Evaluation properties of invariant polynomials.
J. Symb. Comput., 2009

Size of coefficients of lexicographical Groöbner bases: the zero-dimensional, radical and bivariate case.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Change of order for regular chains in positive dimension.
Theor. Comput. Sci., 2008

2006
Complexity of polynomial systems representations: triangulation, modular methods, dynamic evaluation. (Complexité des représentations des systèmes de polynômes : triangulation, méthodes modulaires, évaluation dynamique).
PhD thesis, 2006

2005
On the complexity of the D5 principle.
SIGSAM Bull., 2005

Lifting techniques for triangular decompositions.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
Sharp estimates for triangular sets.
Proceedings of the Symbolic and Algebraic Computation, 2004


  Loading...