 | 2011 |
|---|
| 7 |       | 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 |
| 6 | | 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) |
| 2010 |
|---|
| 5 | | Sylvain Chevillard,
Mioara Joldes,
Christoph Quirin Lauter:
Sollya: An Environment for the Development of Numerical Codes.
ICMS 2010: 28-31 |
| 2009 |
|---|
| 4 | | 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 |
|---|
| 3 | | 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 |
|---|
| 2 | | Nicolas Brisebarre,
Sylvain Chevillard:
Efficient polynomial L-approximations.
IEEE Symposium on Computer Arithmetic 2007: 169-176 |
| 1 | | Sylvain Chevillard,
Christoph Quirin Lauter:
A Certified Infinite Norm for the Implementation of Elementary Functions.
QSIC 2007: 153-160 |
Data released under the ODC-BY 1.0 license — See also our legal information page