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	2014	2015	2016	2017	2018	2019	Total
Livros	0	0	0	0	0	0	0
Livros Editados	1	0	0	0	0	0	1
Jornais	4	4	10	7	10	5	40
Capítulos de livros	0	1	1	0	0	0	2
Artigos de Conferencia	12	11	14	5	8	3	53
Habilitações (Livre Docência)	0	0	1	0	0	0	1
Teses	1	2	2	1	0	1	7

LIP6

• J. Berthomieu, B. Boyer, J.‑Ch. Faugère : “Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences”, Journal of Symbolic Computation, vol. 83 (Supplement C), pp. 36-67, (Elsevier) [Berthomieu 2017a]
• 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, (Springer Verlag) [Faugère 2017a]
• J.‑Ch. Faugère, Ch. Mou : “Sparse FGLM algorithms”, Journal of Symbolic Computation, vol. 80 (3), pp. 538-569, (Elsevier) [Faugère 2017b]
• A. Herman, H. Hong, E. Tsigaridas : “Improving Root Separation Bounds”, Journal of Symbolic Computation, (Elsevier) [Herman 2017]
• Victor Y. Pan, E. Tsigaridas : “Accelerated Approximation of the Complex Roots and Factors of a Univariate Polynomial”, Theoretical Computer Science, (Elsevier) [Pan 2017a]
• Victor Y. Pan, E. Tsigaridas : “Nearly optimal computations with structured matrices”, Theoretical Computer Science, (Elsevier) [Pan 2017b]
• M. Safey El Din, É. Schost : “A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets”, Journal of the ACM (JACM), vol. 63 (6), pp. 48:1-48:37, (ACM) [Safey El Din 2017]