| Équipes actuelles : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Publications PolSys | 2023 | 2024 | 2025 | Total |
|---|---|---|---|---|
| Livres | 0 | 0 | 0 | 0 |
| Éditions de livres | 0 | 0 | 0 | 0 |
| Articles de revues | 7 | 7 | 0 | 14 |
| Chapitres de livres | 0 | 0 | 0 | 0 |
| Conférences | 7 | 9 | 1 | 17 |
| Habilitations | 1 | 0 | 0 | 1 |
| Soutenances de thèse | 2 | 1 | 0 | 3 |
- M. Burr, Sh. Gao, E. Tsigaridas : “The Complexity of Subdivision for Diameter-Distance Tests”, Journal of Symbolic Computation, (Elsevier) [Burr 2018]
- H. Chabanne, H. Maghrebi, E. Prouff : “Linear Repairing Codes and Side-Channel Attacks”, IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018 (1), pp. 118-141, (IACR) [Chabanne 2018]
- J.‑Ch. Faugère, A. Wallet : “The Point Decomposition Problem over Hyperelliptic Curves: toward efficient computations of Discrete Logarithms in even characteristic”, Designs, Codes and Cryptography, vol. 86, pp. 2279–2314, (Springer Verlag) [Faugère 2018]
- H. Fawzi, M. Safey El Din : “A lower bound on the positive semidefinite rank of convex bodies”, SIAM Journal on Applied Algebra and Geometry, vol. 2 (1), pp. 126-139, (Society for Industrial and Applied Mathematics) [Fawzi 2018]
- G. Grasegger, Ch. Koutschan, E. Tsigaridas : “Lower bounds on the number of realizations of rigid graphs”, Experimental Mathematics, pp. 1-22, (Taylor & Francis) [Grasegger 2018]
- J.‑B. Lasserre, V. Magron : “Optimal data fitting: a moment approach”, SIAM Journal on Optimization, vol. 28 (4), pp. 3127-3144, (Society for Industrial and Applied Mathematics) [Lasserre 2018]
- V. Magron : “Interval Enclosures of Upper Bounds of Roundoff Errors using Semidefinite Programming”, ACM Transactions on Mathematical Software, vol. 44 (4), pp. 41:1-41:18, (Association for Computing Machinery) [Magron 2018a]
- V. Magron, M. Safey El Din : “RealCertify: a Maple package for certifying non-negativity”, ACM Communications in Computer Algebra, vol. 52 (2), pp. 34-37, (Association for Computing Machinery (ACM)) [Magron 2018c]
- M. Safey El Din, E. Schost : “Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization”, Journal of Symbolic Computation, vol. 87, pp. 176-206, (Elsevier) [Safey El Din 2018a]
- A. Strzebonski, E. Tsigaridas : “Univariate real root isolation in an extension field and applications”, Journal of Symbolic Computation, (Elsevier) [Strzebonski 2018]