Équipes actuelles : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Ancienne équipe : | ACASA |
- D. Augot, M. Bardet, J.‑Ch. Faugère : “On the decoding of binary cyclic codes with the Newton's identities”, Journal of Symbolic Computation, vol. 44 (12), Gröbner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics, pp. 1608-1625, (Elsevier) [Augot 2009b]
- F. Boulier, D. Lazard, F. Ollivier, M. Petitot : “Computing representations for radicals of finitely generated differential ideals”, Applicable Algebra in Engineering, Communication and Computing, vol. 20 (1), pp. 73-121, (Springer Verlag) [Boulier 2009]
- H. Everett, D. Lazard, S. Lazard, M. Safey El Din : “The Voronoi diagram of three lines”, Discrete and Computational Geometry, vol. 42 (1), pp. 94-130, (Springer Verlag) [Everett 2009b]
- J.‑Ch. Faugère, L. Perret : “An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography”, Journal of Symbolic Computation, vol. 44 (12), pp. 1676-1689, (Elsevier) [Faugère 2009f]
- A. Hashemi : “Nullstellensätze for Zero–Dimensional Gröbner Bases”, Computational Complexity, vol. 18 (1), pp. 155-168, (Springer Verlag) [Hashemi 2009]
- M. Kida, G. Renault, K. Yokoyama : “QUINTIC POLYNOMIALS OF HASHIMOTO–TSUNOGAI, BRUMER AND KUMMER”, International Journal of Number Theory, vol. 05 (4), pp. 555-571, (World Scientific Publishing) [Kida 2009]
- D. Lazard : “Thirty years of Polynomial System Solving, and now?”, Journal of Symbolic Computation, vol. 44 (3), pp. 222-231, (Elsevier) [Lazard 2009c]
- D. Lazard, S. McCallum : “Iterated Discriminants”, Journal of Symbolic Computation, vol. 44 (9), pp. 1176-1193, (Elsevier) [Lazard 2009d]