PolSys - Artigos de Conferencia

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	10	6	48
Capítulos de livros	1	1	0	0	0	0	2
Artigos de Conferencia	10	15	6	10	7	0	48
Habilitações (Livre Docência)	0	2	0	0	0	0	2
Teses	2	2	1	0	0	0	5

LIP6

L. Barthélémy, D. Kahrobaei, G. Renault, Z. Šunić : “Quadratic time algorithm for inversion of binary permutation polynomials”, ICMS 2018 - International Congress on Mathematical Software, vol. 10931, Lecture Notes in Computer Science, South Bend, IN, United States, pp. 19-27, (Springer) [Barthélémy 2018]
E. Bartzos, I. Emiris, J. Legerský, E. Tsigaridas : “On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs”, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, New York, United States, pp. 55-62, (ACM) [Bartzos 2018]
M. Bender, J.‑Ch. Faugère, A. Mantzaflaris, E. Tsigaridas : “Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors”, ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York, United States [Bender 2018a]
M. Bender, J.‑Ch. Faugère, E. Tsigaridas : “Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case”, ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York, United States [Bender 2018b]
J. Berthomieu, J.‑Ch. Faugère : “A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations”, ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York, United States [Berthomieu 2018b]
D. Henrion, S. Naldi, M. Safey El Din : “Exact algorithms for semidefinite programs with degenerate feasible set”, ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York City, United States, pp. 17p. [Henrion 2018]
H. Maghrebi, E. Prouff : “On the Use of Independent Component Analysis to Denoise Side-Channel Measurements”, COSADE 2018 - 9^th International Workshop on Constructive Side-Channel Analysis and Secure Design, vol. 10815, Lecture Notes in Computer Science, Singapore, Singapore, pp. 61-81, (Springer) [Maghrebi 2018]
V. Magron, M. Safey El Din : “On Exact Polya and Putinar's Representations”, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, New-York, United States, pp. 279-286, (ACM) [Magron 2018c]
C. Riener, M. Safey El Din : “Real root finding for equivariant semi-algebraic systems”, ISSAC 20018 - 43rd International Symposium on Symbolic and Algebraic Computation, New-York, United States [Riener 2018]
M. Safey El Din, Zh. Yang, L. Zhi : “On the complexity of computing real radicals of polynomial systems”, ISSAC '18 - The 2018 ACM on International Symposium on Symbolic and Algebraic Computation, New-York, United States, pp. 351-358, (ACM) [Safey El Din 2018b]