Vincent Lefèvre

Orcid: 0000-0002-4045-8273

According to our database1, Vincent Lefèvre authored at least 31 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Emacs-Cairo Scrolling Bug due to Floating-Point Inaccuracy.
Proceedings of the 31st IEEE Symposium on Computer Arithmetic, 2024

2023
Accurate Calculation of Euclidean Norms Using Double-word Arithmetic.
ACM Trans. Math. Softw., March, 2023

2020
Alternative Split Functions and Dekker's Product.
Proceedings of the 27th IEEE Symposium on Computer Arithmetic, 2020

2019
Accurate Complex Multiplication in Floating-Point Arithmetic.
Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

2018
Handbook of Floating-Point Arithmetic (2nd Ed.).
Springer, ISBN: 978-3-319-76526-6, 2018

2017
Correctly Rounded Arbitrary-Precision Floating-Point Summation.
IEEE Trans. Computers, 2017

Optimized Binary64 and Binary128 Arithmetic with GNU MPFR.
Proceedings of the 24th IEEE Symposium on Computer Arithmetic, 2017

2015
On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic.
Numer. Algorithms, 2015

2014
On the maximum relative error when computing x^n in floating-point arithmetic.
CoRR, 2014

2013
SIPE: Small Integer Plus Exponent.
Proceedings of the 21st IEEE Symposium on Computer Arithmetic, 2013

2012
On the Computation of Correctly Rounded Sums.
IEEE Trans. Computers, 2012

2010
Computing correctly rounded integer powers in floating-point arithmetic.
ACM Trans. Math. Softw., 2010

Why and How to Use Arbitrary Precision.
Comput. Sci. Eng., 2010

LEMA: towards a language for reliable arithmetic.
ACM Commun. Comput. Algebra, 2010


2009
An Efficient Rounding Boundary Test for {rm pow}(x, y) in Double Precision.
IEEE Trans. Computers, 2009

2007
MPFR: A multiple-precision binary floating-point library with correct rounding.
ACM Trans. Math. Softw., 2007

Computing Integer Powers in Floating-Point Arithmetic
CoRR, 2007

Worst Cases of a Periodic Function for Large Arguments.
Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

2006
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

2005
Searching Worst Cases of a One-Variable Function Using Lattice Reduction.
IEEE Trans. Computers, 2005

The Generic Multiple-Precision Floating-Point Addition With Exact Rounding (as in the MPFR Library)
CoRR, 2005

New Results on the Distance between a Segment and Z<sup>2</sup>. Application to the Exact Rounding.
Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

2004
Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic.
Numer. Algorithms, 2004

2003
On-the-Fly Range Reduction.
J. VLSI Signal Process., 2003

Worst Cases and Lattice Reduction.
Proceedings of the 16th IEEE Symposium on Computer Arithmetic (Arith-16 2003), 2003

2001
Worst Cases for Correct Rounding of the Elementary Functions in Double Precision.
Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001

2000
Constant Multipliers for FPGAs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1998
Toward Correctly Rounded Transcendentals.
IEEE Trans. Computers, 1998

An Algorithm that Computes a Lower Bound on the Distance Between a Segment and ℤ2.
Proceedings of the Developments in Reliable Computing, 1998

1997
Towards Correctly Rounded Transcendentals.
Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997


  Loading...