default search action
Thi Xuan Vu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Cordian Riener, Robin Schabert, Thi Xuan Vu:
Connectivity in Symmetric Semi-Algebraic Sets. ISSAC 2024: 162-169 - [i9]Cordian Riener, Robin Schabert, Thi Xuan Vu:
Connectivity in Symmetric Semi-Algebraic Sets. CoRR abs/2404.09749 (2024) - 2023
- [j3]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. J. Symb. Comput. 116: 365-399 (2023) - [c4]George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Faster real root decision algorithm for symmetric polynomials. ISSAC 2023: 452-460 - [i8]George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Faster real root decision algorithm for symmetric polynomials. CoRR abs/2306.03855 (2023) - 2022
- [c3]Thi Xuan Vu:
Computing Critical Points for Algebraic Systems Defined by Hyperoctahedral Invariant Polynomials. ISSAC 2022: 167-175 - [c2]George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou:
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. ISSAC 2022: 351-360 - [i7]George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou:
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. CoRR abs/2202.09329 (2022) - [i6]Thi Xuan Vu:
On the complexity of invariant polynomials under the action of finite reflection groups. CoRR abs/2203.04123 (2022) - [i5]Thi Xuan Vu:
Computing critical points for algebraic systems defined by hyperoctahedral invariant polynomials. CoRR abs/2203.16094 (2022) - 2021
- [j2]George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex. 66: 101557 (2021) - [j1]Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Solving determinantal systems using homotopy techniques. J. Symb. Comput. 104: 754-804 (2021) - 2020
- [b1]Thi Xuan Vu:
Homotopy algorithms for solving structured determinantal systems. (Algorithmes d'homotopie pour la résolution de systèmes déterminants structurés). University of Waterloo, Ontario, Canada, 2020 - [i4]George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR abs/2009.00844 (2020) - [i3]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. CoRR abs/2009.00847 (2020)
2010 – 2019
- 2018
- [i2]Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Solving determinantal systems using homotopy techniques. CoRR abs/1802.10409 (2018) - 2017
- [c1]Vincent Neiger, Thi Xuan Vu:
Computing Canonical Bases of Modules of Univariate Relations. ISSAC 2017: 357-364 - [i1]Vincent Neiger, Thi Xuan Vu:
Computing Canonical Bases of Modules of Univariate Relations. CoRR abs/1705.10649 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint