Bibliography

Publications of the year

Articles in International Peer-Reviewed Journals

• 1M. Burr, S. Gao, E. Tsigaridas.
  
  The Complexity of Subdivision for Diameter-Distance Tests, in: Journal of Symbolic Computation, 2018.
  
  https://hal.inria.fr/hal-01953446
• 2H. Chabanne, H. Maghrebi, E. Prouff.
  
  Linear Repairing Codes and Side-Channel Attacks, in: IACR Transactions on Cryptographic Hardware and Embedded Systems, February 2018, vol. 2018, n^o 1, pp. 118-141. [ DOI : 10.13154/tches.v2018.i1.118-141 ]
  
  https://hal.archives-ouvertes.fr/hal-01973360
• 3H. Fawzi, M. Safey El Din.
  
  A lower bound on the positive semidefinite rank of convex bodies, in: SIAM Journal on Applied Algebra and Geometry, 2018, vol. 2, n^o 1, pp. 126-139. [ DOI : 10.1137/17M1142570 ]
  
  https://hal.inria.fr/hal-01657849
• 4G. Grasegger, C. Koutschan, E. Tsigaridas.
  
  Lower bounds on the number of realizations of rigid graphs, in: Experimental Mathematics, 2018, pp. 1-22.
  
  https://hal.inria.fr/hal-01711441
• 5J.-B. B. Lasserre, V. Magron.
  
  Optimal data fitting: a moment approach, in: SIAM Journal on Optimization, November 2018, vol. 28, n^o 4, pp. 3127-3144, https://arxiv.org/abs/1802.03259 - 21 pages, 5 figures. [ DOI : 10.1137/18M1170108 ]
  
  https://hal.archives-ouvertes.fr/hal-01706850
• 6V. Magron.
  
  Interval Enclosures of Upper Bounds of Roundoff Errors using Semidefinite Programming, in: ACM Transactions on Mathematical Software, August 2018, vol. 44, n^o 4, pp. 41:1–41:18, https://arxiv.org/abs/1611.01318 - 18 pages, 2 tables, 1 figure. [ DOI : 10.1145/3206430 ]
  
  https://hal.archives-ouvertes.fr/hal-01956815
• 7V. Magron, A. Rocca, T. Dang.
  
  Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations, in: IEEE Transactions on Computers, 2018, https://arxiv.org/abs/1802.04385 - 14 pages, 2 figures, 2 tables. Extension of the work in arXiv:1610.07038. [ DOI : 10.1109/TC.2018.2851235 ]
  
  https://hal.archives-ouvertes.fr/hal-01956817
• 8V. Magron, M. Safey El Din.
  
  RealCertify: a Maple package for certifying non-negativity, in: ACM Communications in Computer Algebra, June 2018, vol. 52, n^o 2, pp. 34-37, https://arxiv.org/abs/1805.02201 - 4 pages, 2 tables. [ DOI : 10.1145/3282678.3282681 ]
  
  https://hal.archives-ouvertes.fr/hal-01956812
• 9V. Magron, M. Safey El Din, M. Schweighofer.
  
  Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials, in: Journal of Symbolic Computation, 2018.
  
  https://hal.archives-ouvertes.fr/hal-01538729
• 10M. Safey El Din, É. Schost.
  
  Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization, in: Journal of Symbolic Computation, 2018, vol. 87, pp. 176-206, https://arxiv.org/abs/1605.07433. [ DOI : 10.1016/j.jsc.2017.08.001 ]
  
  https://hal.inria.fr/hal-01319729
• 11A. Strzebonski, E. Tsigaridas.
  
  Univariate real root isolation in an extension field and applications, in: Journal of Symbolic Computation, 2018.
  
  https://hal.inria.fr/hal-01248390

International Conferences with Proceedings

• 12L. Barthelemy, D. Kahrobaei, G. Renault, Z. Šunić.
  
  Quadratic time algorithm for inversion of binary permutation polynomials, in: ICMS 2018 - International Congress on Mathematical Software, South Bend, IN, United States, J. H. Davenpo, M. Kauers, G. Labah, J. Urba (editors), Lecture Notes in Computer Science, Springer, July 2018, vol. 10931, pp. 19-27. [ DOI : 10.1007/978-3-319-96418-8_3 ]
  
  https://hal.archives-ouvertes.fr/hal-01981320
• 13E. Bartzos, I. Emiris, J. Legerský, E. Tsigaridas.
  
  On the maximal number of real embeddings of spatial minimally rigid graphs, in: ISSAC '18 International Symposium on Symbolic and Algebraic Computation, New York, United States, C. Arreche (editor), ACM, July 2018, pp. 55-62. [ DOI : 10.1145/3208976.3208994 ]
  
  https://hal.archives-ouvertes.fr/hal-01710518
• 14M. R. Bender, J.-C. Faugère, A. Mantzaflaris, E. Tsigaridas.
  
  Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors, in: ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York, United States, July 2018, https://arxiv.org/abs/1805.05060. [ DOI : 10.1145/3208976.3209011 ]
  
  https://hal.inria.fr/hal-01787549
• 15M. R. Bender, J.-C. Faugère, E. Tsigaridas.
  
  Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case, in: ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York, United States, July 2018, https://arxiv.org/abs/1805.03577. [ DOI : 10.1145/3208976.3209018 ]
  
  https://hal.inria.fr/hal-01787423
• 16J. Berthomieu, J.-C. Faugère.
  
  A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations, in: ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York, United States, July 2018. [ DOI : 10.1145/3208976.3209017 ]
  
  https://hal.inria.fr/hal-01784369
• 17H. Maghrebi, E. Prouff.
  
  On the Use of Independent Component Analysis to Denoise Side-Channel Measurements, in: COSADE 2018 - 9th International Workshop on Constructive Side-Channel Analysis and Secure Design, Singapore, Singapore, Lecture Notes in Computer Science, Springer, April 2018, vol. 10815, pp. 61-81. [ DOI : 10.1007/978-3-319-89641-0_4 ]
  
  https://hal.archives-ouvertes.fr/hal-01973322
• 18V. Magron, M. Safey El Din.
  
  On Exact Polya and Putinar's Representations, in: ISSAC '18 International Symposium on Symbolic and Algebraic Computation, New-York, United States, ACM, July 2018, pp. 279-286, https://arxiv.org/abs/1802.10339 - 19 pages, 4 algorithms, 3 tables. [ DOI : 10.1145/3208976.3208986 ]
  
  https://hal.archives-ouvertes.fr/hal-01720612
• 19C. Riener, M. Safey El Din.
  
  Real root finding for equivariant semi-algebraic systems, in: ISSAC 20018 - 43rd International Symposium on Symbolic and Algebraic Computation, New-York, United States, July 2018, https://arxiv.org/abs/1806.08121.
  
  https://hal.inria.fr/hal-01819106
• 20M. Safey El Din, Z.-H. Yang, L. Zhi.
  
  On the complexity of computing real radicals of polynomial systems, in: ISSAC '18 - The 2018 ACM on International Symposium on Symbolic and Algebraic Computation, New-York, United States, ACM, July 2018, pp. 351-358. [ DOI : 10.1145/3208976.3209002 ]
  
  https://hal.inria.fr/hal-01956596

Conferences without Proceedings

• 21D. Henrion, S. Naldi, M. Safey El Din.
  
  Exact algorithms for semidefinite programs with degenerate feasible set, in: ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York City, United States, July 2018, 17 p, https://arxiv.org/abs/1802.02834.
  
  https://hal.archives-ouvertes.fr/hal-01705590

Other Publications

• 22J. G. Alcázar, J. Caravantes, G. M. Diaz-Toca, E. Tsigaridas.
  
  Computing the topology of a planar or space hyperelliptic curve, January 2019, working paper or preprint.
  
  https://hal.inria.fr/hal-01968776
• 23M. R. Bender, J.-C. Faugère, L. Perret, E. Tsigaridas.
  
  A nearly optimal algorithm to decompose binary forms, June 2018, https://arxiv.org/abs/1810.12588 - In submission.
  
  https://hal.inria.fr/hal-01907777
• 24J. Berthomieu, J.-C. Faugère.
  
  A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations, November 2018, working paper or preprint.
  
  https://hal.inria.fr/hal-01935229
• 25J. Berthomieu, J.-C. Faugère.
  
  In-depth comparison of the Berlekamp–Massey–Sakata and the Scalar-FGLM algorithms: the adaptive variants, June 2018, https://arxiv.org/abs/1806.00978 - working paper or preprint.
  
  https://hal.inria.fr/hal-01805478
• 26J. D. Hauenstein, M. Safey El Din, É. Schost, T. X. Vu.
  
  Solving determinantal systems using homotopy techniques, February 2018, https://arxiv.org/abs/1802.10409 - working paper or preprint.
  
  https://hal.inria.fr/hal-01719170
• 27V. Magron, M. Forets, D. Henrion.
  
  Semidefinite Approximations of Invariant Measures for Polynomial Systems, July 2018, https://arxiv.org/abs/1807.00754 - 28 pages, 14 figures.
  
  https://hal.archives-ouvertes.fr/hal-01828443
• 28V. Magron, M. Safey El Din.
  
  On Exact Polya, Hilbert-Artin and Putinar's Representations, November 2018, https://arxiv.org/abs/1811.10062 - 29 pages, 4 tables, extended version of the paper from ISSAC'18 conference (available at arXiv::1802.10339).
  
  https://hal.archives-ouvertes.fr/hal-01935727
• 29F. Morain, G. Renault, B. Smith.
  
  Deterministic factoring with oracles, February 2018, https://arxiv.org/abs/1802.08444 - working paper or preprint.
  
  https://hal.inria.fr/hal-01715832