Vincent Lefèvre's Publications

Publications

[CalLef2004a]

J. Calmet and V. Lefèvre. Toward the integration of numerical computations into the OMSCS framework. In V.G. Ganzha and E.W. Mayr and E.V. Vorozhtsov, editor, Proceedings of the 7th International Workshop on Computer Algebra in Scientific Computing (CASC 2004), pages 71–79, Saint Petersburg, Russia, July 2004.
Alternative links: [hal/ccsd] [postscript] [PDF]

[CasLefZim2004a]

A. Castiel, V. Lefèvre and P. Zimmermann. Le « dilemme du fabricant de tables » ou comment calculer juste. Interstices, February 2004.
Alternative link: [hal/ccsd]

[DHLMRZ2004a]

D. Defour, G. Hanrot, V. Lefèvre, J.-M. Muller, N. Revol and P. Zimmermann. Proposal for a standardization of mathematical function implementation in floating-point arithmetic. Numerical Algorithms, 37(1–4):367–375, December 2004.
Alternative link: [hal/ccsd]

[DHLMRZ2004b]

D. Defour, G. Hanrot, V. Lefèvre, J.-M. Muller, N. Revol and P. Zimmermann. Proposal for a standardization of mathematical function implementation in floating-point arithmetic. Research report RR-5406, INRIA, December 2004.
Alternative links: [hal/ccsd] [abstract]

[DinLef2000a]

F. de Dinechin and V. Lefèvre. Constant multiplier for FPGAs. In Second International Workshop on Engineering of Reconfigurable Hardware/Software Objects (ENREGLE 2000), Monte Carlo Resort, Las Vegas, Nevada, USA, June 2000. Also available as LIP research report 2000-18.
Alternative link: [postscript]

[DinLef2000b]

F. de Dinechin and V. Lefèvre. Constant multiplier for FPGAs. Research report RR2000-18, Laboratoire de l'Informatique du Parallélisme, Lyon, France, May 2000.
Alternative link: [abstract]

[FHLPZ2005a]

L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier and P. Zimmermann. MPFR: a multiple-precision binary floating-point library with correct rounding. Research report RR-5753, INRIA, November 2005.
Alternative links: [hal/ccsd] [postscript] [PDF] [postscript] [PDF] [abstract]

[FHLPZ2006a]

L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier and P. Zimmermann. MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Transactions on Mathematical Software, 33(2), June 2007.
Alternative link: [hal/ccsd]

[HLMRZ2001a]

G. Hanrot, V. Lefèvre, J.-M. Muller, N. Revol and P. Zimmermann. Some notes for a proposal for elementary function implementation in floating-point arithmetic. June 2001.
Alternative link: [citeseer]

[HLSZ2007a]

G. Hanrot, V. Lefèvre, D. Stehlé and P. Zimmermann. Worst cases of a periodic function for large arguments. Research report RR-6106, INRIA, January 2007.
Alternative link: [hal/ccsd]

[HLSZ2007b]

G. Hanrot, V. Lefèvre, D. Stehlé and P. Zimmermann. Worst cases of a periodic function for large arguments. In Peter Kornerup and Jean-Michel Muller, editor, Proceedings of the 18th IEEE Symposium on Computer Arithmetic, pages 133–140, Montpellier, France, June 2007. IEEE Computer Society Press, Los Alamitos, CA.
Alternative links: [hal/ccsd] [abstract]

[KorLefMul2007a]

P. Kornerup, V. Lefèvre and J.-M. Muller. Computing integer powers in floating-point arithmetic. Research report RR2007-23, Laboratoire de l'Informatique du Parallélisme, Lyon, France, May 2007.
Alternative link: [hal/ccsd]

[KorLefMul2007b]

P. Kornerup, V. Lefèvre and J.-M. Muller. Computing integer powers in floating-point arithmetic. In Proceedings of 41th Conference on signals, systems and computers, November 2007. IEEE Conference Publishing Services.

[LauLef2007a]

Ch. Lauter and V. Lefèvre. An efficient rounding boundary test for pow(x,y) in double precision. Research report RR2007-36, Laboratoire de l'Informatique du Parallélisme, Lyon, France, September 2007.
Alternative link: [hal/ccsd]

[Lef1997a]

V. Lefèvre. An algorithm that computes a lower bound on the distance between a segment and Z². Research report RR1997-18, Laboratoire de l'Informatique du Parallélisme, Lyon, France, June 1997.
Alternative links: [postscript] [abstract] [citeseer]

[Lef1999a]

V. Lefèvre. An algorithm that computes a lower bound on the distance between a segment and Z². In Developments in Reliable Computing, pages 203–212. Kluwer, Dordrecht, Netherlands, 1999.

[Lef1999b]

V. Lefèvre. Multiplication by an integer constant. Research report RR1999-06, Laboratoire de l'Informatique du Parallélisme, Lyon, France, January 1999.
Alternative links: [postscript] [abstract] [citeseer]

[Lef2000a]

V. Lefèvre. Moyens arithmétiques pour un calcul fiable. PhD thesis, École Normale Supérieure de Lyon, Lyon, France, January 2000.
Alternative links: [postscript] [abstract]

[Lef2001a]

V. Lefèvre. Multiplication by an integer constant. Research report RR-4192, INRIA, May 2001.
Alternative links: [hal/ccsd] [postscript] [PDF] [postscript] [abstract] [citeseer]

[Lef2001b]

V. Lefèvre. Multiplication par une constante. Réseaux et Systèmes Répartis, Calculateurs Parallèles, 13(4–5):465–484, 2001.
Alternative link: [hal/ccsd]

[Lef2002a]

V. Lefèvre. Multiplication by an integer constant: lower bounds on the code length. Research report RR-4493, INRIA, July 2002.
Alternative links: [hal/ccsd] [postscript] [PDF] [postscript] [abstract]

[Lef2003a]

V. Lefèvre. Multiplication by an integer constant: lower bounds on the code length. In Proceedings of the 5th Conference on Real Numbers and Computers, pages 131–146, École Normale Supérieure de Lyon, France, September 2003.
Alternative links: [hal/ccsd] [postscript] [PDF]

[Lef2004a]

V. Lefèvre. The generic multiple-precision floating-point addition with exact rounding (as in the MPFR library). In Proceedings of the 6th Conference on Real Numbers and Computers, pages 135–145, Dagstuhl, Germany, November 2004.
Alternative links: [hal/ccsd] [postscript] [PDF] [PDF]

[Lef2005a]

V. Lefèvre. New results on the distance between a segment and Z². Application to the exact rounding. In Paolo Montuschi and Eric Schwarz, editor, Proceedings of the 17th IEEE Symposium on Computer Arithmetic, pages 68–75, Cape Cod, MA, USA, June 2005. IEEE Computer Society Press, Los Alamitos, CA.
Alternative link: [hal/ccsd]

[Lef2005b]

V. Lefèvre. The Euclidean division implemented with a floating-point division and a floor. Research report RR-5604, INRIA, June 2005.
Alternative links: [hal/ccsd] [postscript] [PDF] [postscript] [PDF] [abstract]

[Lef2005c]

V. Lefèvre. The Euclidean division implemented with a floating-point multiplication and a floor. Preprint, July 2005.
Alternative links: [hal/ccsd] [postscript] [PDF]

[LefMul1999a]

V. Lefèvre and J.-M. Muller. Table methods for the elementary functions. In F.T. Luk, editor, Proceedings of the SPIE — The International Society for Optical Engineering, volume 3807, pages 43–49, Denver, Colorado, 1999.

[LefMul2000a]

V. Lefèvre and J.-M. Muller. On-the-fly range reduction. Research report RR2000-34, Laboratoire de l'Informatique du Parallélisme, Lyon, France, November 2000.
Alternative links: [hal/ccsd] [postscript] [abstract] [citeseer]

[LefMul2000b]

V. Lefèvre and J.-M. Muller. Worst cases for correct rounding of the elementary functions in double precision. Research report RR2000-35, Laboratoire de l'Informatique du Parallélisme, Lyon, France, November 2000.
Alternative links: [hal/ccsd] [postscript] [abstract] [citeseer]

[LefMul2000c]

V. Lefèvre and J.-M. Muller. On-the-fly range reduction. In SPIE's International Symposium on Optical Science and Technology, San Diego, CA, August 2000.

[LefMul2000d]

V. Lefèvre and J.-M. Muller. L'erreur en arithmétique des ordinateurs. Le Temps des Savoirs, (2):147–157, October 2000.

[LefMul2001a]

V. Lefèvre and J.-M. Muller. Worst cases for correct rounding of the elementary functions in double precision. In Neil Burgess and Luigi Ciminiera, editor, Proceedings of the 15th IEEE Symposium on Computer Arithmetic, pages 111–118, Vail, Colorado, 2001. IEEE Computer Society Press, Los Alamitos, CA.
Alternative links: [hal/ccsd] [abstract]

[LefMul2001b]

V. Lefèvre and J.-M. Muller. On-the-fly range reduction. Journal of VLSI Signal Processing, 33(1):31–35, January 2003.
Alternative link: [hal/ccsd]

[LefMul2007a]

V. Lefèvre and J.-M. Muller. Some notes on the possible under/overflow of the most common elementary functions. May 2007.
Alternative link: [hal/ccsd]

[LefMulTis1997a]

V. Lefèvre, J.-M. Muller and A. Tisserand. Towards correctly rounded transcendentals. In Proceedings of the 13th IEEE Symposium on Computer Arithmetic, Asilomar, USA, 1997. IEEE Computer Society Press, Los Alamitos, CA.

[LefMulTis1998a]

V. Lefèvre, J.-M. Muller and A. Tisserand. The table maker's dilemma. Research report RR1998-12, Laboratoire de l'Informatique du Parallélisme, Lyon, France, February 1998.
Alternative links: [postscript] [abstract] [citeseer]

[LefMulTis1998b]

V. Lefèvre, J.-M. Muller and A. Tisserand. Towards correctly rounded transcendentals. IEEE Transactions on Computers, 47(11):1235–1243, November 1998.
Alternative link: [citeseer]

[LefSteZim2006a]

V. Lefèvre, D. Stehlé and P. Zimmermann. Worst cases for the exponential function in the IEEE 754r decimal64 format. In Reliable Implementation of Real Number Algorithms: Theory and Practice, volume 5045, 2008. Springer-Verlag. To appear.
Alternative link: [hal/ccsd]

[LefZim2004a]

V. Lefèvre and P. Zimmermann. Arithmétique flottante. Research report RR-5105, INRIA, February 2004.
Alternative links: [hal/ccsd] [postscript] [PDF] [postscript] [abstract]

[MPFR]

G. Hanrot, V. Lefèvre, P. Pélissier and P. Zimmermann. The MPFR library. 2005.

[SteLefZim2002a]

D. Stehlé, V. Lefèvre and P. Zimmermann. Worst cases and lattice reduction. Research report RR-4586, INRIA, October 2002.
Alternative links: [hal/ccsd] [postscript] [abstract]

[SteLefZim2003a]

D. Stehlé, V. Lefèvre and P. Zimmermann. Worst cases and lattice reduction. In Jean-Claude Bajard and Michael Schulte, editor, Proceedings of the 16th IEEE Symposium on Computer Arithmetic, pages 142–147, Santiago de Compostela, Spain, 2003. IEEE Computer Society Press, Los Alamitos, CA.
Alternative links: [hal/ccsd] [abstract]

[SteLefZim2004a]

D. Stehlé, V. Lefèvre and P. Zimmermann. Searching worst cases of a one-variable function using lattice reduction. IEEE Transactions on Computers, 54(3):340–346, March 2005.
Alternative links: [hal/ccsd] [abstract]

Notes on the HTTP Negociation

When a paper is available in several formats, the chosen format for the main link will be the one your browser will ask via the preferences declared in the Accept HTTP header. Remember to configure your browser according to your preferences, if it allows it! For Mozilla, you can open about:config and modify the value of network.http.accept.default.

Back to the list of my publications.