equipos actuales : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Antiguos equipo : | ACASA |
Publicaciones PolSys | 2023 | 2024 | Total |
---|---|---|---|
Libros | 0 | 0 | 0 |
Libros editados | 0 | 0 | 0 |
Artículos de revistas | 8 | 6 | 14 |
Capítulos de libros | 0 | 0 | 0 |
Documentos de conferencias | 7 | 9 | 16 |
Habilitaciones | 1 | 0 | 1 |
Tesis | 2 | 0 | 2 |
- M. Albrecht, C. Cid, J.‑Ch. Faugère, R. Fitzpatrick, L. Perret : “On the complexity of the BKW algorithm on LWE”, Designs, Codes and Cryptography, vol. 74 (2), pp. 26, (Springer Verlag) [Albrecht 2015]
- M. Bardet, J.‑Ch. Faugère, B. Salvy : “On the complexity of the F5 Gröbner basis algorithm”, Journal of Symbolic Computation, vol. 70, pp. 49-70, (Elsevier) [Bardet 2015]
- J. Berthomieu, J.‑Ch. Faugère, L. Perret : “Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case”, Journal of Complexity, vol. 31 (4), pp. 590-616, (Elsevier) [Berthomieu 2015b]
- Victor Y. Pan, E. Tsigaridas : “Nearly Optimal Refinement of Real Roots of a Univariate Polynomial”, Journal of Symbolic Computation, vol. 74, pp. 181–204, (Elsevier) [Pan 2015a]