FR

EN

Homepage Inria website
  • Inria login
  • The Inria's Research Teams produce an annual Activity Report presenting their activities and their results of the year. These reports include the team members, the scientific program, the software developed by the team and the new results of the year. The report also describes the grants, contracts and the activities of dissemination and teaching. Finally, the report gives the list of publications of the year.

  • Legal notice
  • Cookie management
  • Personal data
  • Cookies


Bibliography

Publications of the year

Articles in International Peer-Reviewed Journals

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

Other Publications