Assisted verification of elementary functions using Gappa. - Florent de Dinechin; Christoph Quirin Lauter; Guillaume Melquiond (SAC, 2006)

A Certified Infinite Norm for the Implementation of Elementary Functions. - Sylvain Chevillard; Christoph Quirin Lauter (QSIC, 2007)

Fast and correctly rounded logarithms in double-precision. - Florent de Dinechin; Christoph Quirin Lauter; Jean-Michel Muller (RAIRO Theor. Informatics Appl., 2007)

Certifying floating-point implementations using Gappa - Florent de Dinechin; Christoph Quirin Lauter; Guillaume Melquiond (CoRR, 2008)

Optimizing polynomials for floating-point implementation - Florent de Dinechin; Christoph Quirin Lauter (CoRR, 2008)

Certified and Fast Computation of Supremum Norms of Approximation Errors. - Sylvain Chevillard; Mioara Joldes; Christoph Quirin Lauter (IEEE Symposium on Computer Arithmetic, 2009)

An Efficient Rounding Boundary Test for {rm pow}(x, y) in Double Precision. - Christoph Quirin Lauter; Vincent Lefèvre (IEEE Trans. Computers, 2009)

Sollya: An Environment for the Development of Numerical Codes. - Sylvain Chevillard; Mioara Joldes; Christoph Quirin Lauter (ICMS, 2010)

Computing correctly rounded integer powers in floating-point arithmetic. - Peter Kornerup; Christoph Quirin Lauter; Vincent Lefèvre; Nicolas Louvet; Jean-Michel Muller (ACM Trans. Math. Softw., 2010)

Certifying the Floating-Point Implementation of an Elementary Function Using Gappa. - Florent de Dinechin; Christoph Quirin Lauter; Guillaume Melquiond (IEEE Trans. Computers, 2011)

Efficient and accurate computation of upper bounds of approximation errors. - Sylvain Chevillard; J. Harrison; Mioara Joldes; Christoph Quirin Lauter (Theor. Comput. Sci., 2011)

Radix conversion for IEEE754-2008 mixed radix floating-point arithmetic. - Olga Kupriianova; Christoph Quirin Lauter; Jean-Michel Muller (ACSSC, 2013)

Comparison between Binary64 and Decimal64 Floating-Point Numbers. - Nicolas Brisebarre; Marc Mezzarobba; Jean-Michel Muller; Christoph Quirin Lauter (IEEE Symposium on Computer Arithmetic, 2013)

On Ziv's rounding test. - Florent de Dinechin; Christoph Quirin Lauter; Jean-Michel Muller; Serge Torres (ACM Trans. Math. Softw., 2013)

A domain splitting algorithm for the mathematical functions code generator. - Olga Kupriianova; Christoph Quirin Lauter (ACSSC, 2014)

Metalibm: A Mathematical Functions Code Generator. - Olga Kupriianova; Christoph Quirin Lauter (ICMS, 2014)

Replacing Branches by Polynomials in Vectorizable Elementary Functions. - Olga Kupriianova; Christoph Quirin Lauter (SCAN, 2014)

Easing development of precision-sensitive applications with a beyond-quad-precision library. - Christoph Quirin Lauter (ACSSC, 2015)

Determining fixed-point formats for a digital filter implementation using the worst-case peak gain measure. - Anastasia Volkova; Thibault Hilaire; Christoph Quirin Lauter (ACSSC, 2015)

Code Generators for Mathematical Functions. - Nicolas Brunie; Florent de Dinechin; Olga Kupriianova; Christoph Quirin Lauter (ARITH, 2015)

Semi-Automatic Floating-Point Implementation of Special Functions. - Christoph Quirin Lauter; Marc Mezzarobba (ARITH, 2015)

Reliable Evaluation of the Worst-Case Peak Gain Matrix in Multiple Precision. - Anastasia Volkova; Thibault Hilaire; Christoph Quirin Lauter (ARITH, 2015)

Efficient Calculations of Faithfully Rounded l2-Norms of n-Vectors. - Stef Graillat; Christoph Quirin Lauter; Ping Tak Peter Tang; Naoya Yamanaka; Shin'ichi Oishi (ACM Trans. Math. Softw., 2015)

A new open-source SIMD vector libm fully implemented with high-level scalar C. - Christoph Quirin Lauter (ACSSC, 2016)

Comparison between Binary and Decimal Floating-Point Numbers. - Nicolas Brisebarre; Christoph Quirin Lauter; Marc Mezzarobba; Jean-Michel Muller (IEEE Trans. Computers, 2016)

An efficient software implementation of correctly rounded operations extending FMA: A + b + c and a × b + c × d. - Christoph Quirin Lauter (ACSSC, 2017)

Reliable Verification of Digital Implemented Filters Against Frequency Specifications. - Anastasia Volkova; Christoph Quirin Lauter; Thibault Hilaire (ARITH, 2017)

Rigorous Polynomial Approximation. - Christoph Quirin Lauter (ACSSC, 2018)

A Correctly Rounded Mixed-Radix Fused-Multiply-Add. - Clothilde Jeangoudoux; Christoph Quirin Lauter (ARITH, 2018)

Precision Adaptation for Fast and Accurate Polynomial Evaluation Generation. - Nicolas Brunie; Christoph Quirin Lauter; Guillaume Revy (ASAP, 2019)

A Framework for Semi-Automatic Precision and Accuracy Analysis for Fast and Rigorous Deep Learning. - Christoph Quirin Lauter; Anastasia Volkova (ARITH, 2020)

Arithmetic Approaches for Rigorous Design of Reliable Fixed-Point LTI Filters. - Anastasia Volkova; Thibault Hilaire; Christoph Quirin Lauter (IEEE Trans. Computers, 2020)

Interval constraint-based mutation testing of numerical specifications. - Clothilde Jeangoudoux; Eva Darulova; Christoph Quirin Lauter (ISSTA, 2021)

Emulating Round-to-Nearest Ties-to-Zero "Augmented" Floating-Point Operations Using Round-to-Nearest Ties-to-Even Arithmetic. - Sylvie Boldo; Christoph Quirin Lauter; Jean-Michel Muller (IEEE Trans. Computers, 2021)

A parallel compensated Horner scheme for SIMD architecture. - Stef Graillat; Youness Ibrahimy; Clothilde Jeangoudoux; Christoph Quirin Lauter (ARITH, 2023)

Machine Learning-Based Screening for Pediatric Hip Dysplasia: Towards a Validated Approach. - María L. Reyna Cruz; Ricardo Tabares; Martine Ceberio; Vladik Kreinovich; Christoph Quirin Lauter; Cecilia A. Márquez Barraza (IEEECONF, 2024)

Logarithmic Format for Quantization on Forward Passes with High Accuracy. - Kristalys Ruiz-Rohena; Mayra Robles; Johnatan Garcia; Martine Ceberio; Christoph Quirin Lauter (IEEECONF, 2024)

Just-in-Accuracy: Mobile Approach to Uncertainty. - Martine Ceberio; Christoph Quirin Lauter; Vladik Kreinovich (J. Mobile Multimedia, 2024)