default search action
Christoph Quirin Lauter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Martine Ceberio, Christoph Quirin Lauter, Vladik Kreinovich:
Just-in-Accuracy: Mobile Approach to Uncertainty. J. Mobile Multimedia 20(3): 665-678 (2024) - 2023
- [c23]Stef Graillat, Youness Ibrahimy, Clothilde Jeangoudoux, Christoph Quirin Lauter:
A parallel compensated Horner scheme for SIMD architecture. ARITH 2023: 131-138 - 2021
- [j10]Sylvie Boldo, Christoph Quirin Lauter, Jean-Michel Muller:
Emulating Round-to-Nearest Ties-to-Zero "Augmented" Floating-Point Operations Using Round-to-Nearest Ties-to-Even Arithmetic. IEEE Trans. Computers 70(7): 1046-1058 (2021) - [c22]Clothilde Jeangoudoux, Eva Darulova, Christoph Quirin Lauter:
Interval constraint-based mutation testing of numerical specifications. ISSTA 2021: 388-399 - 2020
- [j9]Anastasia Volkova, Thibault Hilaire, Christoph Quirin Lauter:
Arithmetic Approaches for Rigorous Design of Reliable Fixed-Point LTI Filters. IEEE Trans. Computers 69(4): 489-504 (2020) - [c21]Christoph Quirin Lauter, Anastasia Volkova:
A Framework for Semi-Automatic Precision and Accuracy Analysis for Fast and Rigorous Deep Learning. ARITH 2020: 103-110 - [i4]Christoph Quirin Lauter, Anastasia Volkova:
A Framework for Semi-Automatic Precision and Accuracy Analysis for Fast and Rigorous Deep Learning. CoRR abs/2002.03869 (2020)
2010 – 2019
- 2019
- [c20]Nicolas Brunie, Christoph Quirin Lauter, Guillaume Revy:
Precision Adaptation for Fast and Accurate Polynomial Evaluation Generation. ASAP 2019: 41 - 2018
- [c19]Christoph Quirin Lauter:
Rigorous Polynomial Approximation. ACSSC 2018: 120-124 - [c18]Clothilde Jeangoudoux, Christoph Quirin Lauter:
A Correctly Rounded Mixed-Radix Fused-Multiply-Add. ARITH 2018: 21-28 - 2017
- [c17]Christoph Quirin Lauter:
An efficient software implementation of correctly rounded operations extending FMA: A + b + c and a × b + c × d. ACSSC 2017: 452-456 - [c16]Anastasia Volkova, Christoph Quirin Lauter, Thibault Hilaire:
Reliable Verification of Digital Implemented Filters Against Frequency Specifications. ARITH 2017: 180-187 - 2016
- [j8]Nicolas Brisebarre, Christoph Quirin Lauter, Marc Mezzarobba, Jean-Michel Muller:
Comparison between Binary and Decimal Floating-Point Numbers. IEEE Trans. Computers 65(7): 2032-2044 (2016) - [c15]Christoph Quirin Lauter:
A new open-source SIMD vector libm fully implemented with high-level scalar C. ACSSC 2016: 407-411 - 2015
- [j7]Stef Graillat, Christoph Quirin Lauter, Ping Tak Peter Tang, Naoya Yamanaka, Shin'ichi Oishi:
Efficient Calculations of Faithfully Rounded l2-Norms of n-Vectors. ACM Trans. Math. Softw. 41(4): 24:1-24:20 (2015) - [c14]Anastasia Volkova, Thibault Hilaire, Christoph Quirin Lauter:
Determining fixed-point formats for a digital filter implementation using the worst-case peak gain measure. ACSSC 2015: 737-741 - [c13]Christoph Quirin Lauter:
Easing development of precision-sensitive applications with a beyond-quad-precision library. ACSSC 2015: 742-746 - [c12]Christoph Quirin Lauter, Marc Mezzarobba:
Semi-Automatic Floating-Point Implementation of Special Functions. ARITH 2015: 58-65 - [c11]Nicolas Brunie, Florent de Dinechin, Olga Kupriianova, Christoph Quirin Lauter:
Code Generators for Mathematical Functions. ARITH 2015: 66-73 - [c10]Anastasia Volkova, Thibault Hilaire, Christoph Quirin Lauter:
Reliable Evaluation of the Worst-Case Peak Gain Matrix in Multiple Precision. ARITH 2015: 96-103 - 2014
- [c9]Olga Kupriianova, Christoph Quirin Lauter:
A domain splitting algorithm for the mathematical functions code generator. ACSSC 2014: 1271-1275 - [c8]Olga Kupriianova, Christoph Quirin Lauter:
Metalibm: A Mathematical Functions Code Generator. ICMS 2014: 713-717 - [c7]Olga Kupriianova, Christoph Quirin Lauter:
Replacing Branches by Polynomials in Vectorizable Elementary Functions. SCAN 2014: 14-22 - 2013
- [j6]Florent de Dinechin, Christoph Quirin Lauter, Jean-Michel Muller, Serge Torres:
On Ziv's rounding test. ACM Trans. Math. Softw. 39(4): 25:1-25:19 (2013) - [c6]Olga Kupriianova, Christoph Quirin Lauter, Jean-Michel Muller:
Radix conversion for IEEE754-2008 mixed radix floating-point arithmetic. ACSSC 2013: 1134-1138 - [c5]Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller, Christoph Quirin Lauter:
Comparison between Binary64 and Decimal64 Floating-Point Numbers. IEEE Symposium on Computer Arithmetic 2013: 145-152 - [i3]Olga Kupriianova, Christoph Quirin Lauter, Jean-Michel Muller:
Radix Conversion for IEEE754-2008 Mixed Radix Floating-Point Arithmetic. CoRR abs/1312.0455 (2013) - 2011
- [j5]Florent de Dinechin, Christoph Quirin Lauter, Guillaume Melquiond:
Certifying the Floating-Point Implementation of an Elementary Function Using Gappa. IEEE Trans. Computers 60(2): 242-253 (2011) - [j4]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
- [j3]Peter Kornerup, Christoph Quirin Lauter, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller:
Computing correctly rounded integer powers in floating-point arithmetic. ACM Trans. Math. Softw. 37(1): 4:1-4:23 (2010) - [c4]Sylvain Chevillard, Mioara Joldes, Christoph Quirin Lauter:
Sollya: An Environment for the Development of Numerical Codes. ICMS 2010: 28-31
2000 – 2009
- 2009
- [j2]Christoph Quirin Lauter, Vincent Lefèvre:
An Efficient Rounding Boundary Test for {rm pow}(x, y) in Double Precision. IEEE Trans. Computers 58(2): 197-207 (2009) - [c3]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
- [i2]Florent de Dinechin, Christoph Quirin Lauter, Guillaume Melquiond:
Certifying floating-point implementations using Gappa. CoRR abs/0801.0523 (2008) - [i1]Florent de Dinechin, Christoph Quirin Lauter:
Optimizing polynomials for floating-point implementation. CoRR abs/0803.0439 (2008) - 2007
- [j1]Florent de Dinechin, Christoph Quirin Lauter, Jean-Michel Muller:
Fast and correctly rounded logarithms in double-precision. RAIRO Theor. Informatics Appl. 41(1): 85-102 (2007) - [c2]Sylvain Chevillard, Christoph Quirin Lauter:
A Certified Infinite Norm for the Implementation of Elementary Functions. QSIC 2007: 153-160 - 2006
- [c1]Florent de Dinechin, Christoph Quirin Lauter, Guillaume Melquiond:
Assisted verification of elementary functions using Gappa. SAC 2006: 1318-1322
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-08-11 01:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint