Follow
Christoph Lauter
Christoph Lauter
Assistant Professor of Computer Science, University of Alaska Anchorage
Verified email at alaska.edu - Homepage
Title
Cited by
Cited by
Year
Sollya: An environment for the development of numerical codes
S Chevillard, M Joldeş, C Lauter
Mathematical Software–ICMS 2010: Third International Congress on …, 2010
1452010
Certifying the floating-point implementation of an elementary function using Gappa
F De Dinechin, C Lauter, G Melquiond
IEEE Transactions on Computers 60 (2), 242-253, 2010
1372010
Assisted verification of elementary functions using Gappa
F De Dinechin, CQ Lauter, G Melquiond
Proceedings of the 2006 ACM symposium on Applied computing, 1318-1322, 2006
1062006
CR-LIBM A library of correctly rounded elementary functions in double-precision
C Daramy-Loirat, D Defour, F De Dinechin, M Gallet, N Gast, C Lauter, ...
LIP,, 2006
632006
Fast and correctly rounded logarithms in double-precision
F De Dinechin, C Lauter, JM Muller
RAIRO-Theoretical Informatics and Applications 41 (1), 85-102, 2007
602007
Arrondi correct de fonctions mathématiques: fonctions univariées et bivariées, certification et automatisation
CQ Lauter
École normale supérieure (Lyon; 1987-2009), 2008
462008
Basic building blocks for a triple-double intermediate format
CQ Lauter
INRIA, LIP, 2005
462005
Code generators for mathematical functions
N Brunie, F De Dinechin, O Kupriianova, C Lauter
2015 IEEE 22nd Symposium on Computer Arithmetic, 66-73, 2015
372015
Metalibm: A mathematical functions code generator
O Kupriianova, C Lauter
Mathematical Software–ICMS 2014: 4th International Congress, Seoul, South …, 2014
372014
A certified infinite norm for the implementation of elementary functions
S Chevillard, C Lauter
Seventh International Conference on Quality Software (QSIC 2007), 153-160, 2007
302007
Fast correct rounding of elementary functions in double precision using double-extended arithmetic
F De Dinechin, D Defour, C Lauter
INRIA, LIP, 2004
292004
Certified and fast computation of supremum norms of approximation errors
S Chevillard, M Joldes, C Lauter
2009 19th IEEE Symposium on Computer Arithmetic, 169-176, 2009
272009
Reliable evaluation of the Worst-Case Peak Gain matrix in multiple precision
A Volkova, T Hilaire, C Lauter
2015 IEEE 22nd Symposium on Computer Arithmetic, 96-103, 2015
242015
Optimizing polynomials for floating-point implementation
F De Dinechin, CQ Lauter
arXiv preprint arXiv:0803.0439, 2008
202008
A new open-source SIMD vector libm fully implemented with high-level scalar C
C Lauter
2016 50th Asilomar Conference on Signals, Systems and Computers, 407-411, 2016
192016
Determining fixed-point formats for a digital filter implementation using the worst-case peak gain measure
A Volkova, T Hilaire, C Lauter
2015 49th Asilomar Conference on Signals, Systems and Computers, 737-741, 2015
192015
An Efficient Rounding Boundary Test for {\rm pow}(x, y) in Double Precision
CQ Lauter, V Lefèvre
IEEE Transactions on Computers 58 (2), 197-207, 2008
192008
Efficient Calculations of Faithfully Rounded l2-Norms of n-Vectors
S Graillat, C Lauter, PTP Tang, N Yamanaka, S Oishi
ACM Transactions on Mathematical Software (TOMS) 41 (4), 1-20, 2015
172015
On Ziv's rounding test
F De Dinechin, C Lauter, JM Muller, S Torres
ACM Transactions on Mathematical Software (TOMS) 39 (4), 1-19, 2013
142013
Reliable verification of digital implemented filters against frequency specifications
A Volkova, C Lauter, T Hilaire
2017 IEEE 24th Symposium on Computer Arithmetic (ARITH), 180-187, 2017
122017
The system can't perform the operation now. Try again later.
Articles 1–20