Publicações 2010-2019

• 2019
  • J. Berthomieu, J.‑Ch. Faugère : “In-depth comparison of the Berlekamp–Massey–Sakata and the Scalar-FGLM algorithms: the adaptive variants”, Journal of Symbolic Computation (2019)
• 2018
  • J. Berthomieu, J.‑Ch. Faugère : “A polynomial-division-based algorithm for computing linear recurrence relations”, ISSAC 2018 - 43^rd International Symposium on Symbolic and Algebraic Computation, New York, USA (2018)
  • J. Berthomieu, J.‑Ch. Faugère : “A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations”, (2018)
• 2017
  • J. Berthomieu, B. Boyer, J.‑Ch. Faugère : “Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences”, Journal of Symbolic Computation, vol. 83 (Supplement C), pp. 36-67, (Elsevier) (2017)
  • J. Berthomieu, J.‑Ch. Faugère : “In-depth comparison of the Berlekamp – Massey – Sakata and the Scalar-FGLM algorithms: the non adaptive variants”, (2017)
• 2016
  • J. Berthomieu, J.‑Ch. Faugère : “Guessing Linear Recurrence Relations of Sequence Tuples and P-recursive Sequences with Linear Algebra”, 41^st International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, pp. 95-102 (2016)
• 2015
  • J. Berthomieu, J.‑Ch. Faugère, L. Perret : “Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case”, Journal of Complexity, vol. 31 (4), pp. 590-616, (Elsevier) (2015)
  • J. Berthomieu, B. Boyer, J.‑Ch. Faugère : “Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences”, 40^th International Symposium on Symbolic and Algebraic Computation, Proceedings of the 40^th International Symposium on Symbolic and Algebraic Computation, Bath, United Kingdom, pp. 61-68 (2015)
• 2013
  • J. Berthomieu, G. Lecerf, G. Quintin : “Polynomial root finding over local rings and application to error correcting codes”, Applicable Algebra in Engineering, Communication and Computing, vol. 24 (6), pp. 413-443, (Springer), (ISBN: 0938-1279) (2013)
  • J. Berthomieu : “Decomposition of multihomogeneous polynomials: minimal number of variables”, (2013)
• 2012
  • J. van der Hoeven, G. Lecerf, B. Mourrain, Ph. Trébuchet, J. Berthomieu, D. Diatta, A. Mantzaflaris : “Mathemagix”, ACM Communications in Computer Algebra, vol. 45 (3/4), pp. 186-188, (Association for Computing Machinery (ACM)) (2012)
  • G. Lecerf, J. Berthomieu : “Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations”, Mathematics of Computation, vol. 81 (279), pp. 1799-1821, (ISBN: 0025-5718) (2012)
  • J. Berthomieu, L. Pardo : “Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian”, Journal of Complexity, vol. 28 (3), pp. 388-421, (ISBN: 0885-064X) (2012)
  • J. Berthomieu, R. Lebreton : “Relaxed~$p$-adic Hensel lifting for algebraic systems”, ISSAC '12: Proceedings of the 2012 international symposium on Symbolic and algebraic computation, ISSAC '12, Grenoble, FranceNew York, NY, USA, pp. 59-66, (ACM) (2012)
• 2011
  • J. van der Hoeven, G. Lecerf, B. Mourrain, Ph. Trébuchet, J. Berthomieu, D. Diatta, A. Mantzaflaris : “Mathemagix, the quest of modularity and efficiency for symbolic and certified numeric computation”, ACM Communications in Computer Algebra, vol. 45 (3), pp. 186-188 (2011)
  • J. Berthomieu, J. van der Hoeven, G. Lecerf : “Relaxed algorithms for~$p$-adic numbers”, J.~Théor. Nombres Bordeaux, vol. 23 (3), pp. 541-577, (ISBN: 1246-7405) (2011)
• 2010
  • J. Berthomieu, P. Hivert, H. Mourtada : “Computing Hironaka’s invariants: Ridge and Directrix”, chapitre de Arithmetic, Geometry, Cryptography and Coding Theory 2009, vol. 521, Contemp. Math., Providence, RI, pp. 9-20, (Amer. Math. Soc.) (2010)