default search action
Rémi Imbach
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j5]Rémi Imbach, Guillaume Moroz:
Fast evaluation and root finding for polynomials with floating-point coefficients. J. Symb. Comput. 127: 102372 (2025) - 2023
- [c10]Rémi Imbach
, Guillaume Moroz
Fast evaluation and root finding for polynomials with floating-point coefficients. ISSAC 2023: 325-334 - [i9]Rémi Imbach, Guillaume Moroz:
Fast evaluation and root finding for polynomials with floating-point coefficients. CoRR abs/2302.06244 (2023) - 2022
- [c9]Rémi Imbach, Victor Y. Pan:
Accelerated Subdivision for Clustering Roots of Polynomials Given by Evaluation Oracles. CASC 2022: 143-164 - [i8]Rémi Imbach, Victor Y. Pan:
Accelerated Subdivision for Clustering Roots of Polynomials given by Evaluation Oracles. CoRR abs/2206.08622 (2022) - 2021
- [j4]Rémi Imbach, Marc Pouget
Clustering Complex Zeros of Triangular Systems of Polynomials. Math. Comput. Sci. 15(2): 271-292 (2021) - [c8]Rémi Imbach, Victor Y. Pan:
Root Radii and Subdivision for Polynomial Root-Finding. CASC 2021: 136-156 - [i7]Rémi Imbach, Victor Y. Pan:
Root Radii and Subdivision for Polynomial Root-Finding. CoRR abs/2102.10821 (2021) - 2020
- [c7]Rémi Imbach, Victor Y. Pan:
New progress in univariate polynomial root finding. ISSAC 2020: 249-256
2010 – 2019
- 2019
- [c6]Rémi Imbach, Victor Y. Pan, Chee Yap, Ilias S. Kotsireas, Vitaly Zaderman:
Root-Finding with Implicit Deflation. CASC 2019: 236-245 - [c5]Rémi Imbach, Victor Y. Pan:
New Practical Advances in Polynomial Root Clustering. MACIS 2019: 122-137 - [i6]Rémi Imbach, Victor Y. Pan:
Polynomial root clustering and explicit deflation. CoRR abs/1906.04920 (2019) - [i5]Rémi Imbach, Victor Y. Pan:
New practical advances in polynomial root clustering. CoRR abs/1911.06706 (2019) - 2018
- [c4]Rémi Imbach, Victor Y. Pan, Chee Yap:
Implementation of a Near-Optimal Complex Root Clustering Algorithm. ICMS 2018: 235-244 - [i4]Rémi Imbach:
Local solution clustering for a triangular system of polynomials. CoRR abs/1806.10164 (2018) - [i3]Rémi Imbach, Victor Y. Pan, Chee Yap:
Implementation of a Near-Optimal Complex Root Clustering Algorithm. CoRR abs/1806.10584 (2018) - 2017
- [j3]Rémi Imbach, Guillaume Moroz, Marc Pouget
A certified numerical algorithm for the topology of resultant and discriminant curves. J. Symb. Comput. 80: 285-306 (2017) - [j2]Rémi Imbach, Pascal Mathis, Pascal Schreck:
A robust and efficient method for solving point distance problems by homotopy. Math. Program. 163(1-2): 115-144 (2017) - 2016
- [i2]Rémi Imbach:
A Subdivision Solver for Systems of Large Dense Polynomials. CoRR abs/1603.07916 (2016) - 2015
- [c3]Rémi Imbach, Guillaume Moroz, Marc Pouget:
Numeric and Certified Isolation of the Singularities of the Projection of a Smooth Space Curve. MACIS 2015: 78-92 - [i1]Rémi Imbach, Pascal Mathis, Pascal Schreck:
A Robust and Efficient Method for Solving Geometrical Constraint Problems by Homotopy. CoRR abs/1503.07901 (2015) - 2014
- [j1]Rémi Imbach, Pascal Schreck, Pascal Mathis:
Leading a continuation method by geometry for solving geometric constraints. Comput. Aided Des. 46: 138-147 (2014) - 2012
- [c2]Pascal Mathis, Pascal Schreck, Rémi Imbach:
Decomposition of geometrical constraint systems with reparameterization. SAC 2012: 102-108 - 2011
- [c1]Rémi Imbach, Pascal Mathis, Pascal Schreck:
Tracking Method for Reparametrized Geometrical Constraint Systems. SYNASC 2011: 31-38
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-12-09 22:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: