Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 1M. Bender.
  
  Algorithms for sparse polynomial systems : Gröbner basis and resultants, Sorbonne Université, 6 2019, http://page.math.tu-berlin.de/ mbender/etc/thesis.pdf.

Articles in International Peer-Reviewed Journals

• 2E. Bartzos, I. Z. Emiris, J. Legerský, E. Tsigaridas.
  
  On the maximal number of real embeddings of minimally rigid graphs in ${ℝ}^2$, ${ℝ}^3$ and $S^2$, in: Journal of Symbolic Computation, 2019, https://arxiv.org/abs/1811.12800, forthcoming. [ DOI : 10.1016/j.jsc.2019.10.015 ]
  
  https://hal.archives-ouvertes.fr/hal-02271782
• 3J. Berthomieu, J.-C. Faugère.
  
  In-depth comparison of the Berlekamp–Massey–Sakata and the Scalar-FGLM algorithms: the adaptive variants, in: Journal of Symbolic Computation, 2019, https://arxiv.org/abs/1806.00978, forthcoming. [ DOI : 10.1016/j.jsc.2019.09.001 ]
  
  https://hal.inria.fr/hal-01805478
• 4L. Busé, A. Mantzaflaris, E. Tsigaridas.
  
  Matrix formulae for Resultants and Discriminants of Bivariate Tensor-product Polynomials, in: Journal of Symbolic Computation, June 2020, vol. 98, pp. 65-83. [ DOI : 10.1016/j.jsc.2019.07.007 ]
  
  https://hal.inria.fr/hal-01654263
• 5M. Conde Pena, R. Durán Díaz, J.-C. Faugère, L. Hernández Encinas, L. Perret.
  
  Non-quantum cryptanalysis of the noisy version of Aaronson–Christiano's quantum money scheme, in: IET Information Security, July 2019, vol. 13, n^o 4, pp. 362-366. [ DOI : 10.1049/iet-ifs.2018.5307 ]
  
  https://hal.inria.fr/hal-02395072
• 6I. Z. Emiris, A. Mantzaflaris, E. Tsigaridas.
  
  Multilinear Polynomial Systems: Root Isolation and Bit Complexity, in: Journal of Symbolic Computation, 2019, Special Issue of the Journal of Symbolic Computation on Milestones in Computer Algebra (MICA 2016), forthcoming.
  
  https://hal.inria.fr/hal-02099556
• 7I. Z. Emiris, B. Mourrain, E. Tsigaridas.
  
  Separation bounds for polynomial systems, in: Journal of Symbolic Computation, 2019. [ DOI : 10.1016/j.jsc.2019.07.001 ]
  
  https://hal.inria.fr/hal-01105276
• 8D. Henrion, S. Naldi, M. Safey El Din.
  
  Real root finding for low rank linear matrices, in: Applicable Algebra in Engineering, Communication and Computing, 2019, https://arxiv.org/abs/1506.05897. [ DOI : 10.1007/s00200-019-00396-w ]
  
  https://hal.archives-ouvertes.fr/hal-01159210
• 9D. Henrion, S. Naldi, M. Safey El Din.
  
  SPECTRA – a Maple library for solving linear matrix inequalities in exact arithmetic, in: Optimization Methods and Software, January 2019, vol. 34, n^o 1, pp. 62-78, https://arxiv.org/abs/1611.01947 - Significantly extended version. [ DOI : 10.1080/10556788.2017.1341505 ]
  
  https://hal.laas.fr/hal-01393022
• 10V. Magron, M. Forets, D. Henrion.
  
  Semidefinite Approximations of Invariant Measures for Polynomial Systems, in: Discrete and Continuous Dynamical Systems - Series B, December 2019, vol. 24, n^o 12, pp. 6745-6770, https://arxiv.org/abs/1807.00754 - 28 pages, 14 figures. [ DOI : 10.3934/dcdsb.2019165 ]
  
  https://hal.archives-ouvertes.fr/hal-01828443
• 11V. Magron, M. Safey El Din, M. Schweighofer.
  
  Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials, in: Journal of Symbolic Computation, 2019, vol. 93, pp. 200-220. [ DOI : 10.1016/j.jsc.2018.06.005 ]
  
  https://hal.archives-ouvertes.fr/hal-01538729
• 12L. Masure, C. Dumas, E. Prouff.
  
  A Comprehensive Study of Deep Learning for Side-Channel Analysis, in: IACR Transactions on Cryptographic Hardware and Embedded Systems, November 2019, vol. 2020, n^o 1, pp. 348-375. [ DOI : 10.13154/tches.v2020.i1.348-375 ]
  
  https://hal.archives-ouvertes.fr/hal-02425261
• 13M. Safey El Din, Z.-H. Yang, L. Zhi.
  
  Computing real radicals and S-radicals of polynomial systems, in: Journal of Symbolic Computation, November 2019. [ DOI : 10.1016/j.jsc.2019.10.018 ]
  
  https://hal.sorbonne-universite.fr/hal-02388168
• 14C. da Silva, A. Jacquemard, M. Teixeira.
  
  Periodic Solutions of a Class of Non-autonomous Discontinuous Second-Order Differential Equations, in: Journal of Dynamical and Control Systems, 2019, pp. 1-28, forthcoming. [ DOI : 10.1007/s10883-018-9426-7 ]
  
  https://hal-univ-bourgogne.archives-ouvertes.fr/hal-02094522

International Conferences with Proceedings

• 15A. Bauer, H. Gilbert, G. Renault, M. Rossi.
  
  Assessment of the Key-Reuse Resilience of NewHope, in: CT-RSA 2019 - The Cryptographers' Track at the RSA Conference, San Francisco, United States, M. Matsui (editor), Lecture Notes in Computer Science, Springer, February 2019, vol. 11405, pp. 272-292. [ DOI : 10.1007/978-3-030-12612-4_14 ]
  
  https://hal.archives-ouvertes.fr/hal-02139910
• 16M. R. Bender, J.-C. Faugère, E. P. Tsigaridas.
  
  Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems, in: ISSAC 2019 - 44th International Symposium on Symbolic and Algebraic Computation, Beijing, China, ACM, July 2019, pp. 42-49, https://arxiv.org/abs/1902.00208. [ DOI : 10.1145/3326229.3326248 ]
  
  https://hal.inria.fr/hal-02002689
• 17J.-C. Faugère, L. Perret, J. Ryckeghem.
  
  Software Toolkit for HFE-based Multivariate Schemes, in: CHES 2019 : International Conference on Cryptographic Hardware and Embedded Systems, Atlanta, United States, IACR Transactions on Cryptographic Hardware and Embedded Systems, May 2019, vol. 2019, n^o 3, pp. 257-304. [ DOI : 10.13154/tches.v2019.i3.257-304 ]
  
  https://hal.sorbonne-universite.fr/hal-02389747
• 18E. Kushilevitz, R. Ostrovsky, E. Prouff, A. Rosén, A. Thillard, D. Vergnaud.
  
  Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND, in: TCC 2019 - 17th International Conference on Theory of Cryptography, Nuremberg, Germany, D. Hofheinz, A. Rosen (editors), Lecture Notes in Computer Science, Springer, November 2019, vol. 11892, pp. 386-406. [ DOI : 10.1007/978-3-030-36033-7_15 ]
  
  https://hal.archives-ouvertes.fr/hal-02395052
• 19P. Lairez, M. Mezzarobba, M. Safey El Din.
  
  Computing the volume of compact semi-algebraic sets, in: ISSAC 2019 - International Symposium on Symbolic and Algebraic Computation, Beijing, China, ACM, July 2019, https://arxiv.org/abs/1904.11705.
  
  https://hal.archives-ouvertes.fr/hal-02110556

Other Publications

• 20M. R. Bender, J.-C. Faugère, L. Perret, E. Tsigaridas.
  
  A nearly optimal algorithm to decompose binary forms, April 2019, https://arxiv.org/abs/1810.12588 - Accepted to JSC.
  
  https://hal.archives-ouvertes.fr/hal-01907777
• 21J.-C. Faugère, K. Horan, D. Kahrobaei, M. Kaplan, E. Kashefi, L. Perret.
  
  Fast Quantum Algorithm for Solving Multivariate Quadratic Equations, August 2019, https://arxiv.org/abs/1712.07211 - working paper or preprint.
  
  https://hal.inria.fr/hal-01995374
• 22T.-H. VU.
  
  Solution maps of polynomial variational inequalities, February 2020, working paper or preprint.
  
  https://hal.sorbonne-universite.fr/hal-02468977