Brief Bio
Since September 2024, I have been an Associate Professor (Maître de Conférences) at the Université de Lille, working in the CRIStAL laboratory as part of the CFHP team.
In December 2020, I obtained my PhD in Computer Science under a cotutelle from the University of Waterloo, Canada (supervised by Éric Schost and George Labahn) and Sorbonne University, France (supervised by Mohab Safey El Din). After my doctorate, I was a postdoctoral researcher at UiT The Arctic University of Norway until February 2024, working with Cordian Riener, and spent six months at Johannes Kepler University in Linz, Austria, collaborating with Manuel Kauers.
I obtained my Master’s degree in Computer Science from ENS de Lyon in 2017.Research
My research interests lie in symbolic computation (computer algebra), computational (real) algebraic geometry, and polynomial system solving.
Preprints
- The DenefLipshitz Algorithm (2025), François Boulier, François Lemaire, and Thi Xuan Vu. HAL
- Symbolic Computation with Symmetric Polynomials in Real Algebraic Geometry (2025), Cordian Riener and Thi Xuan Vu. arXiv / HAL
- Deciding Connectivity in Symmetric Semi-Algebraic Sets (2025), Cordian Riener, Robin Schabert, and Thi Xuan Vu. arXiv / HAL
Publications
- Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings (2025), Thi Xuan Vu, In: Proceedings of ISSAC 2025, Guanajuato, Mexico. DOI / arXiv / HAL
-
Connectivity in Symmetric Semi-Algebraic Sets (2024), Cordian Riener, Robin Schabert, and Thi Xuan Vu,
In: Proceedings of ISSAC 2024, Raleigh, USA.
DOI /
arXiv
Robin S. received a SIGSAM Distinguished Student Author Award.
- Computing critical points for invariant algebraic systems (2023), George Labahn, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu, In: Journal of Symbolic Computation. DOI / arXiv
- Faster real root decision algorithm for symmetric polynomials (2023), George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu, In: Proceedings of ISSAC 2023, Tromsø, Norway. DOI / arXiv
- Computing critical points for algebraic systems defined by hyperoctahedral invariant polynomials (2022), Thi Xuan Vu, In: Proceedings of ISSAC 2022, Lille, France. DOI / arXiv
- Rank-sensitive computation of the rank profile of a polynomial matrix (2022), George Labahn, Vincent Neiger, Thi Xuan Vu, and Wei Zhou, In: Proceedings of ISSAC 2022, Lille, France. DOI / arXiv
- Homotopy techniques for solving sparse column support determinantal polynomial systems (2021), George Labahn, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu, In: Journal of Complexity. DOI / arXiv
- Solving determinantal systems using homotopy techniques (2021), Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu, In: Journal of Symbolic Computation. DOI / arXiv
-
Computing canonical bases of modules of univariate relations (2017), Vincent Neiger and Thi Xuan Vu,
In: Proceedings of ISSAC 2017, Kaiserslautern, Germany.
DOI /
arXiv
Received a SIGSAM Distinguished Student Author Award.
PhD Thesis
Homotopy algorithms for solving structured determinantal systems (2020). UW / SUTeaching
I teach undergraduate and graduate courses in algorithms and programming at the Université de Lille.
- Fall 2025: Refresher in Computer Science (M2 Scientific Computing - CM); ODI (L1-TDM); ACT (M1-TD/TP); IIR (M1-TDM)
- 2024-2025 (162h): ODI (L1-TDM); ACT (M1-TD/TP); IIR (M1-TDM); Bases de la Programmation en C (L2 - TD/TP); Algorithmes et Programmation (L1 - TD/TP)
During my doctorate, I was a teaching assistant at the University of Waterloo for the courses: CS 466/666 - Algorithm Design and Analysis; CS 475/675 - Computational Linear Algebra; AMATH 242/CS 371 - Introduction to Computational Math; CS 245 - Logic and Computation; CS 136 - Elementary Algorithm Design and Data Abstraction.
Students
Internship
- Summer 2025 (supervised with François Boulier): Alexis Evaristo (1A Polytech Lille)