default search action
Xavier Dahan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Xavier Dahan:
Faster bivariate lexicographic Groebner bases modulo xk. SCSS (Work in Progress) 2024: 7-12 - 2023
- [c8]Xavier Dahan
:
Chinese Remainder Theorem for bivariate lexicographic Gröbner bases. ISSAC 2023: 208-217 - 2022
- [j9]Xavier Dahan:
Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one. J. Symb. Comput. 110: 24-65 (2022) - 2020
- [c7]Xavier Dahan, Tristan Vaccon
On a non-archimedean broyden method. ISSAC 2020: 114-121 - [i8]Xavier Dahan, Tristan Vaccon:
On a non-archimedean broyden method. CoRR abs/2009.01511 (2020) - [i7]Xavier Dahan:
Lexicographic Groebner bases of bivariate polynomials modulo a univariate one. CoRR abs/2010.14775 (2020)
2010 – 2019
- 2018
- [i6]Xavier Dahan:
Computation of gcd chain over the power of an irreducible polynomial. CoRR abs/1810.09056 (2018) - 2017
- [c6]Xavier Dahan:
Gcd Modulo a Primary Triangular Set of Dimension Zero. ISSAC 2017: 109-116 - [c5]Xavier Dahan:
On the Bit-Size of Non-radical Triangular Sets. MACIS 2017: 264-269 - [i5]Xavier Dahan:
On the bit-size of non-radical triangular sets. CoRR abs/1710.06396 (2017) - 2016
- [c4]Tetsuro Yamashita, Xavier Dahan:
Bit-size reduction of triangular sets in two and three variables. SCSS 2016: 169-182 - 2015
- [j8]Takanori Yasuda, Xavier Dahan, Yun-Ju Huang, Tsuyoshi Takagi, Kouichi Sakurai:
A multivariate quadratic challenge toward post-quantum generation cryptography. ACM Commun. Comput. Algebra 49(3): 105-107 (2015) - [i4]Takanori Yasuda, Xavier Dahan, Yun-Ju Huang, Tsuyoshi Takagi, Kouichi Sakurai:
MQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems. IACR Cryptol. ePrint Arch. 2015: 275 (2015) - [i3]Takanori Yasuda, Xavier Dahan, Kouichi Sakurai:
Characterizing NTRU-Variants Using Group Ring and Evaluating their Lattice Security. IACR Cryptol. ePrint Arch. 2015: 1170 (2015) - 2014
- [j7]Xavier Dahan:
Regular graphs of large girth and arbitrary degree. Comb. 34(4): 407-426 (2014) - 2012
- [j6]Xavier Dahan:
On the structure of lexicographic Gröbner bases in dimension zero. ACM Commun. Comput. Algebra 46(3/4): 82-83 (2012) - [j5]Xavier Dahan, Abdulilah Kadri, Éric Schost:
Bit-size estimates for triangular sets in positive dimension. J. Complex. 28(1): 109-135 (2012) - 2011
- [i2]Xavier Dahan:
Structure of lexicographic Groebner bases in three variables of ideals of dimension zero. CoRR abs/1110.3185 (2011) - 2010
- [j4]Xavier Dahan, Marc Moreno Maza, Éric Schost, Adrien Poteaux:
Almost linear time operations with triangular sets. ACM Commun. Comput. Algebra 44(3/4): 103-104 (2010) - [i1]Xavier Dahan, Abdulilah Kadri, Éric Schost:
Bit-size estimates for triangular sets in positive dimension. CoRR abs/1008.3459 (2010)
2000 – 2009
- 2009
- [j3]Xavier Dahan, Éric Schost, Jie Wu:
Evaluation properties of invariant polynomials. J. Symb. Comput. 44(11): 1592-1604 (2009) - [c3]Xavier Dahan:
Size of coefficients of lexicographical Groöbner bases: the zero-dimensional, radical and bivariate case. ISSAC 2009: 119-126 - 2008
- [j2]Xavier Dahan, Xin Jin, Marc Moreno Maza, Éric Schost:
Change of order for regular chains in positive dimension. Theor. Comput. Sci. 392(1-3): 37-65 (2008) - 2006
- [b1]Xavier Dahan:
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). École Polytechnique, Palaiseau, France, 2006 - 2005
- [j1]Xavier Dahan, Éric Schost, Marc Moreno Maza, Wenyuan Wu, Yuzhen Xie:
On the complexity of the D5 principle. SIGSAM Bull. 39(3): 97-98 (2005) - [c2]Xavier Dahan, Marc Moreno Maza, Éric Schost, Wenyuan Wu, Yuzhen Xie:
Lifting techniques for triangular decompositions. ISSAC 2005: 108-115 - 2004
- [c1]Xavier Dahan, Éric Schost:
Sharp estimates for triangular sets. ISSAC 2004: 103-110
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: