Show Menu
Hide Menu
Laboratório de Ciência da Computação
Opinião do orientador
Organograma
Organisation
Orientadores
Serviços Administrativos
IT Service
Conselho
Conselho do Laboratório
Conselho
Teaching
Como vir ao LIP6
Pesquisa
Axes & Teams
Publicações
Projetos
ERC Projects
European Projects
Priority Research Programmes and Equipments
Common Laboratories
ANR Projects
Relatório Anual
Avaliação
Our skills
Works with us
Software
Patentes
Start-ups
Empregos
Anuário
colóquio
🔒
📫
🇵🇹
🇫🇷
🇬🇧
🇵🇹
-
Computer Science Laboratory
Pesquisa
Publicações
Research reports
Current teams :
ALMASTY
ALSOC
APR
BD
CIAN
ComplexNetworks
DECISION
DELYS
LFI
MOCAH
MoVe
NPA
PEQUAN
PolSys
QI
RO
SMA
SYEL
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
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]
Clayton E. L. Da Silva, Paulo R. Da Silva, A. Jacquemard
: “
Sliding solutions of second-order differential equations with discontinuous right-hand side
”, Mathematical Methods in the Applied Sciences, vol. 40 (14), pp. 5295-5306, (Wiley) [Da Silva 2017]
J.‑Ch. Faugère, Ch. Mou
: “
Sparse FGLM algorithms
”, Journal of Symbolic Computation, vol. 80 (3), pp. 538-569, (Elsevier) [Faugère 2017a]
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, vol. 681, (Elsevier) [Pan 2017a]
Victor Y. Pan, E. Tsigaridas
: “
Nearly optimal computations with structured matrices
”, Theoretical Computer Science, (Elsevier) [Pan 2017b]
M. Safey El Din, E. 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, (Association for Computing Machinery) [Safey El Din 2017]