default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvain Chevillard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j3]Laurent Baratchart, Sylvain Chevillard, Tao Qian:
Minimax principle and lower bounds in H2-rational approximation. J. Approx. Theory 206: 17-47 (2016)- [i2]Adam Cooman, Fabien Seyfert, Martine Olivi, Sylvain Chevillard, Laurent Baratchart:
Model-Free Closed-Loop Stability Analysis: A Linear Functional Approach. CoRR abs/1610.03235 (2016) - 2013
- [c7]Sylvain Chevillard, Marc Mezzarobba:
Multiple-Precision Evaluation of the Airy Ai Function with Reduced Cancellation. IEEE Symposium on Computer Arithmetic 2013: 175-182 - 2012
- [j2]Sylvain Chevillard:
The functions erf and erfc computed with arbitrary precision and explicit error bounds. Inf. Comput. 216: 72-95 (2012) - [i1]Sylvain Chevillard, Marc Mezzarobba:
Multiple precision evaluation of the Airy Ai function with reduced cancellation. CoRR abs/1212.4731 (2012) - 2011
- [j1]Sylvain Chevillard, J. Harrison, Mioara Joldes, Christoph Quirin Lauter:
Efficient and accurate computation of upper bounds of approximation errors. Theor. Comput. Sci. 412(16): 1523-1543 (2011) - [c6]Sylvain Chevillard:
Automatic Generation of Code for the Evaluation of Constant Expressions at Any Precision with a Guaranteed Error Bound. IEEE Symposium on Computer Arithmetic 2011: 225-232 - 2010
- [c5]Sylvain Chevillard, Mioara Joldes, Christoph Quirin Lauter:
Sollya: An Environment for the Development of Numerical Codes. ICMS 2010: 28-31
2000 – 2009
- 2009
- [b1]Sylvain Chevillard:
Évaluation efficace de fonctions numériques - Outils et exemples. (Efficient evaluation of numerical functions - Tools and examples). University of Lyon, France, 2009 - [c4]Sylvain Chevillard, Mioara Joldes, Christoph Quirin Lauter:
Certified and Fast Computation of Supremum Norms of Approximation Errors. IEEE Symposium on Computer Arithmetic 2009: 169-176 - 2008
- [c3]Nicolas Brisebarre, Sylvain Chevillard, Milos D. Ercegovac, Jean-Michel Muller
, Serge Torres:
An efficient method for evaluating polynomial and rational function approximations. ASAP 2008: 233-238 - 2007
- [c2]Nicolas Brisebarre, Sylvain Chevillard:
Efficient polynomial L-approximations. IEEE Symposium on Computer Arithmetic 2007: 169-176 - [c1]Sylvain Chevillard, Christoph Quirin Lauter:
A Certified Infinite Norm for the Implementation of Elementary Functions. QSIC 2007: 153-160
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-04-24 23:04 CEST 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:
