| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Former team : | ACASA |
| Publications PolSys | 2023 | 2024 | Total |
|---|---|---|---|
| Books | 0 | 0 | 0 |
| Edited books | 0 | 0 | 0 |
| Journal articles | 7 | 7 | 14 |
| Book chapters | 0 | 0 | 0 |
| Conference papers | 7 | 9 | 16 |
| Habilitations | 1 | 0 | 1 |
| Thesis | 2 | 1 | 3 |
- M. Bender, J.‑Ch. Faugère, A. Mantzaflaris, E. Tsigaridas : “Koszul-type determinantal formulas for families of mixed multilinear systems”, SIAM Journal on Applied Algebra and Geometry, vol. 5 (4), pp. 589-619, (Society for Industrial and Applied Mathematics) [Bender 2021a]
- M. Bender, J.‑Ch. Faugère, L. Perret, E. Tsigaridas : “A nearly optimal algorithm to decompose binary forms”, Journal of Symbolic Computation, vol. 105, pp. 71-96, (Elsevier) [Bender 2021b]
- B. Bérard, S. Haddad, C. Picaronny, M. Safey El Din, M. Sassolas : “Polynomial interrupt timed automata: Verification and expressiveness”, Information and Computation, vol. 277, pp. 104580, (Elsevier) [Bérard 2021]
- J. Berthomieu, A. Ferguson, M. Safey El Din : “Towards fast one-block quantifier elimination through generalised critical values”, ACM Communications in Computer Algebra, vol. 54 (3), Kalamata, Greece, pp. 109-113, (Association for Computing Machinery (ACM)) [Berthomieu 2021b]
- O. Chakraborty, J.‑Ch. Faugère, L. Perret : “Cryptanalysis of the extension field cancellation cryptosystem”, Designs, Codes and Cryptography, vol. 89 (6), pp. 1335-1364, (Springer Verlag) [Chakraborty 2021]
- I. Emiris, A. Mantzaflaris, E. Tsigaridas : “Multilinear Polynomial Systems: Root Isolation and Bit Complexity”, Journal of Symbolic Computation, vol. 105, Special Issue on Milestones in Computer Algebra (MICA 2016), pp. 145-164, (Elsevier) [Emiris 2021]
- Jonathan D. Hauenstein, M. Safey El Din, E. Schost, Th. Vu : “Solving determinantal systems using homotopy techniques”, Journal of Symbolic Computation, vol. 104, pp. 754-804, (Elsevier) [Hauenstein 2021]
- D. Henrion, S. Naldi, M. Safey El Din : “Exact algorithms for semidefinite programs with degenerate feasible set”, Journal of Symbolic Computation, vol. 104, pp. 942-959, (Elsevier) [Henrion 2021]
- E. 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”, SIAM Journal on Discrete Mathematics, vol. 35 (1), pp. 465-484, (Society for Industrial and Applied Mathematics) [Kushilevitz 2021]
- G. Labahn, M. Safey El Din, E. Schost, Th. Vu : “Homotopy techniques for solving sparse column support determinantal polynomial systems”, Journal of Complexity, vol. 66, pp. 101557, (Elsevier) [Labahn 2021]
- V. Magron, M. Safey El Din : “On Exact Reznick, Hilbert-Artin and Putinar's Representations”, Journal of Symbolic Computation, vol. 107, pp. 221-250, (Elsevier) [Magron 2021]
- B. Pascual‑Escudero, A. Nayak, S. Briot, O. Kermorgant, Ph. Martinet, M. Safey El Din, F. Chaumette : “Complete Singularity Analysis for the Perspective-Four-Point Problem”, International Journal of Computer Vision, vol. 129 (4), pp. 1217–1237, (Springer Verlag) [Pascual-Escudero 2021]
- M. Safey El Din, Zh. Yang, L. Zhi : “Computing real radicals and S-radicals of polynomial systems”, Journal of Symbolic Computation, vol. 102, pp. 259-278, (Elsevier) [Safey El Din 2021]
- T.‑H. VU : “On the solution existence and stability of polynomial optimization problems”, Optimization Letters, (Springer Verlag) [VU 2021]