Equipes atuais :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MLIA MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL Whisper
Antigos grupos :	AnimatLab MALIRE REGAL SALSA SPI SPIRAL
Antigos tópicos de pesquisa :	ANP APA ASIM CALFOR OASIS RP SPI SRC SYSDEF

Publicações PolSys	2015	2016	2017	2018	2019	2020	Total
Livros	0	0	0	0	0	0	0
Livros Editados	0	0	0	0	0	1	1
Jornais	4	10	8	10	8	11	51
Capítulos de livros	1	1	0	0	0	0	2
Artigos de Conferencia	10	15	6	10	7	2	50
Habilitações (Livre Docência)	0	2	0	0	0	0	2
Teses	2	2	1	0	1	0	6

LIP6

• 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]
• K. Chakraborty, S. Sarkar, S. Maitra, B. Mazumdar, D. Mukhopadhyay, E. Prouff, M. Bardet, J.‑Ch. Faugère, B. Salvy : “Redefining the transparency orderOn the complexity of the F5 Gröbner basis algorithm”, Designs, Codes and Cryptography Journal of Symbolic Computation, vol. 70, pp. 49-70, (Elsevier) [Chakraborty 2015]
• 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]