PolSys - Jornais

Publicações PolSys	2021	2022	2023	2024	2025	Total
Livros	0	0	0	0	0	0
Livros Editados	0	0	0	0	0	0
Jornais	14	9	7	7	3	40
Capítulos de livros	0	0	0	0	1	1
Artigos de Conferencia	3	7	7	9	3	29
Habilitações (Livre Docência)	0	0	1	0	0	1
Teses	1	2	2	1	0	6

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]