Jean-Michel Muller

According to our database1, Jean-Michel Muller authored at least 121 papers between 1985 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform.
ACM Trans. Math. Softw., 2020

Algorithms for Manipulating Quaternions in Floating-Point Arithmetic.
Proceedings of the 27th IEEE Symposium on Computer Arithmetic, 2020

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

2019
Algorithms for Triple-Word Arithmetic.
IEEE Trans. Computers, 2019

Semi-Automatic Implementation of the Complementary Error Function.
Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

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

2018
On Various Ways to Split a Floating-Point Number.
Proceedings of the 25th IEEE Symposium on Computer Arithmetic, 2018

A High Throughput Polynomial and Rational Function Approximations Evaluator.
Proceedings of the 25th IEEE Symposium on Computer Arithmetic, 2018

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

2017
Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic.
ACM Trans. Math. Softw., 2017

On the Robustness of the 2Sum and Fast2Sum Algorithms.
ACM Trans. Math. Softw., 2017

Introduction to the Special Issue on Computer Arithmetic.
IEEE Trans. Computers, 2017

Error bounds on complex floating-point multiplication with an FMA.
Math. Comput., 2017

Formal Verification of a Floating-Point Expansion Renormalization Algorithm.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

Formal Correctness of Comparison Algorithms Between Binary64 and Decimal64 Floating-Point Numbers.
Proceedings of the Numerical Software Verification - 10th International Workshop, 2017

Implementation and Performance Evaluation of an Extended Precision Floating-Point Arithmetic Library for High-Accuracy Semidefinite Programming.
Proceedings of the 24th IEEE Symposium on Computer Arithmetic, 2017

The Classical Relative Error Bounds for Computing Sqrt(a^2 + b^2) and c / sqrt(a^2 + b^2) in Binary Floating-Point Arithmetic are Asymptotically Optimal.
Proceedings of the 24th IEEE Symposium on Computer Arithmetic, 2017

On the relative error of computing complex square roots in floating-point arithmetic.
Proceedings of the 51st Asilomar Conference on Signals, Systems, and Computers, 2017

2016
Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions.
IEEE Trans. Computers, 2016

Comparison between Binary and Decimal Floating-Point Numbers.
IEEE Trans. Computers, 2016

Sharp error bounds for complex floating-point inversion.
Numer. Algorithms, 2016

Modern Computer Arithmetic.
Computer, 2016

CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications.
Proceedings of the Mathematical Software - ICMS 2016, 2016

Parallel floating-point expansions for extended-precision GPU computations.
Proceedings of the 27th IEEE International Conference on Application-specific Systems, 2016

A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions.
Proceedings of the 23nd IEEE Symposium on Computer Arithmetic, 2016

Computing floating-point logarithms with fixed-point operations.
Proceedings of the 23nd IEEE Symposium on Computer Arithmetic, 2016

2015
On the Error of Computing <i>ab</i>+<i>cd</i> using Cornea, Harrison and Tang's Method.
ACM Trans. Math. Softw., 2015

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

2014
(M, p, k)-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function.
IEEE Trans. Circuits Syst. II Express Briefs, 2014

Preface to the special issue on Numerical Software: Design, Analysis and Verification.
Sci. Comput. Program., 2014

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

On the computation of the reciprocal of floating point expansions using an adapted Newton-Raphson iteration.
Proceedings of the IEEE 25th International Conference on Application-Specific Systems, 2014

2013
On Ziv's rounding test.
ACM Trans. Math. Softw., 2013

Further analysis of Kahan's algorithm for the accurate computation of 2×2 determinants.
Math. Comput., 2013

On the Componentwise Accuracy of Complex Floating-Point Division with an FMA.
Proceedings of the 21st IEEE Symposium on Computer Arithmetic, 2013

Comparison between Binary64 and Decimal64 Floating-Point Numbers.
Proceedings of the 21st IEEE Symposium on Computer Arithmetic, 2013

Avoiding double roundings in scaled Newton-Raphson division.
Proceedings of the 2013 Asilomar Conference on Signals, 2013

Radix conversion for IEEE754-2008 mixed radix floating-point arithmetic.
Proceedings of the 2013 Asilomar Conference on Signals, 2013

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

Floating-Point Arithmetic on Round-to-Nearest Representations
CoRR, 2012

Rigorous Polynomial Approximation Using Taylor Models in Coq.
Proceedings of the NASA Formal Methods, 2012

(M, p, k)-Friendly Points: A Table-Based Method for Trigonometric Function Evaluation.
Proceedings of the 23rd IEEE International Conference on Application-Specific Systems, 2012

2011
Performing Arithmetic Operations on Round-to-Nearest Representations.
IEEE Trans. Computers, 2011

Midpoints and Exact Points of Some Algebraic Functions in Floating-Point Arithmetic.
IEEE Trans. Computers, 2011

Exact and Approximated Error of the FMA.
IEEE Trans. Computers, 2011

An FPGA architecture for solving the Table Maker's Dilemma.
Proceedings of the 22nd IEEE International Conference on Application-specific Systems, 2011

Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2).
Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

2010
An Efficient Method for Evaluating Complex Polynomials.
J. Signal Process. Syst., 2010

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

Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Newton-Raphson algorithms for floating-point division using an FMA.
Proceedings of the 21st IEEE International Conference on Application-specific Systems Architectures and Processors, 2010

Implementing decimal floating-point arithmetic through binary: Some suggestions.
Proceedings of the 21st IEEE International Conference on Application-specific Systems Architectures and Processors, 2010


2009
Guest Editors' Introduction: Special Section on Computer Arithmetic.
IEEE Trans. Computers, 2009

Design and Implementation of a Radix-4 Complex Division Unit with Prescaling.
Proceedings of the 20th IEEE International Conference on Application-Specific Systems, 2009

2008
Digital Arithmetic.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Correctly Rounded Multiplication by Arbitrary Precision Constants.
IEEE Trans. Computers, 2008

Automatic Generation of Modular Multipliers for FPGA Applications.
IEEE Trans. Computers, 2008

Integer and floating-point constant multipliers for FPGAs.
Proceedings of the 19th IEEE International Conference on Application-Specific Systems, 2008

An efficient method for evaluating polynomial and rational function approximations.
Proceedings of the 19th IEEE International Conference on Application-Specific Systems, 2008

2007
Complex Square Root with Operand Prescaling.
J. VLSI Signal Process., 2007

Fast and correctly rounded logarithms in double-precision.
RAIRO Theor. Informatics Appl., 2007

Correct rounding of algebraic functions.
RAIRO Theor. Informatics Appl., 2007

Computing Integer Powers in Floating-Point Arithmetic
CoRR, 2007

A Hardware-Oriented Method for Evaluating Complex Polynomials.
Proceedings of the IEEE International Conference on Application-Specific Systems, 2007

2006
Computing machine-efficient polynomial approximations.
ACM Trans. Math. Softw., 2006

Choosing starting values for certain Newton-Raphson iterations.
Theor. Comput. Sci., 2006

Leading Guard Digits in Finite Precision Redundant Representations.
IEEE Trans. Computers, 2006

Elementary functions - algorithms and implementation (2. ed.).
Birkhäuser, ISBN: 978-0-8176-4372-0, 2006

2005
High-Speed Function Approximation Using a Minimax Quadratic Interpolator.
IEEE Trans. Computers, 2005

A New Range-Reduction Algorithm.
IEEE Trans. Computers, 2005

Variable Radix Real and Complex Digit-Recurrence Division.
Proceedings of the 16th IEEE International Conference on Application-Specific Systems, 2005

Multiplication Algorithms for Radix-2 RN-Codings and Two's Complement Multiplication Algorithms for Radix-2 RN-Codings and Two's Complement.
Proceedings of the 16th IEEE International Conference on Application-Specific Systems, 2005

Division by Constant for the ST100 DSP Microprocessor.
Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

Some Functions Computable with a Fused-Mac.
Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

2004
Accelerating Correctly Rounded Floating-Point Division when the Divisor Is Known in Advance.
IEEE Trans. Computers, 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

Preface.
Theor. Comput. Sci., 2003

Finding the "truncated" polynomial that is closest to a function
CoRR, 2003

Complex Division with Prescaling of Operands.
Proceedings of the 14th IEEE International Conference on Application-Specific Systems, 2003

"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods.
Proceedings of the 16th IEEE Symposium on Computer Arithmetic (Arith-16 2003), 2003

2002
Real Numbers - Foreword.
Theor. Comput. Sci., 2002

2001
FPGA Implementation of a Faithful Polynomial Approximation for Powering Function Computation.
Proceedings of the Euromicro Symposium on Digital Systems Design 2001 (Euro-DSD 2001), 2001

Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree.
Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 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

Bounds on Runs of Zeros and Ones for Algebraic Functions.
Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001

2000
A Radix-10 BKM Algorithm for Computing Transcendentals on Pocket Computers.
J. VLSI Signal Process., 2000

Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers.
IEEE Trans. Computers, 2000

Improving Goldschmidt Division, Square Root, and Square Root Reciprocal.
IEEE Trans. Computers, 2000

Synthesis for Mixed Arithmetic.
Design Autom. for Emb. Sys., 2000

1999
Foreword: Real Numbers and Computers.
Theor. Comput. Sci., 1999

A Few Results on Table-Based Methods.
Reliab. Comput., 1999

1998
A New Euclidean Division Algorithm for Residue Number Systems.
J. VLSI Signal Process., 1998

Semi-Logarithmic Number Systems.
IEEE Trans. Computers, 1998

Toward Correctly Rounded Transcendentals.
IEEE Trans. Computers, 1998

Foreword to the special issue.
J. Univers. Comput. Sci., 1998

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

1996
Forword to the Special Issue on Real Numbers and Computers.
Theor. Comput. Sci., 1996

On-Line Algorithms for Computing Exponentials and Logarithms.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Modular Range Reduction: A New Algorithm for Fast and Accurate Computation on the Elementary Functions.
J. Univers. Comput. Sci., 1995

Introduction to the Special Issue: "Real Numbers and Computers".
J. Univers. Comput. Sci., 1995

1994
Some Characterizations of Functions Computable in On-Line Arithmetic.
IEEE Trans. Computers, 1994

BKM: A New Hardware Algorithm for Complex Elementary Functions.
IEEE Trans. Computers, 1994

Some Operators for On-Line Radix-2 Computations.
J. Parallel Distributed Comput., 1994

Implementing On Line Arithmetic on PAM.
Proceedings of the Field-Programmable Logic, 1994

1993
Computing Functions cos^{-1} and sin^{-1} Using Cordic.
IEEE Trans. Computers, 1993

The CORDIC Algorithm: New Results for Fast VLSI Implementation.
IEEE Trans. Computers, 1993

A VLSI circuit for on-line polynominal computing: Application to exponential, trigonometric and hyperbolic functions.
Proceedings of the VLSI 93, 1993

Design of a VLSI circuit for on-line evaluation of several elementary functions using their Taylor expansions.
Proceedings of the International Conference on Application-Specific Array Processors, 1993

Fast evaluation of polynomials and inverses of polynomials.
Proceedings of the 11th Symposium on Computer Arithmetic, 29 June, 1993

1991
On-line computing: a survey and some new results.
Proceedings of the Algorithms and Parallel VLSI Architectures II, 1991

Delays of on-line floating point operators in borrow-save representation.
Proceedings of the Algorithms and Parallel VLSI Architectures II, 1991

Implementation of a VLSI polynomial evaluator for real-time applications.
Proceedings of the Application Specific Array Processors, 1991

1989
JANUS, an on-line multiplier/divider for manipulating large numbers.
Proceedings of the 9th Symposium on Computer Arithmetic, 1989

Some results about on-line computation of functions.
Proceedings of the 9th Symposium on Computer Arithmetic, 1989

1988
Hardwired Polynomial Evaluation.
J. Parallel Distributed Comput., 1988

1987
A Way to Build Efficient Carry-Skip Adders.
IEEE Trans. Computers, 1987

The FELIN arithmetic coprocessor chip.
Proceedings of the 8th IEEE Symposium on Computer Arithmetic, 1987

1985
Une méthodologie du calcul des fonctions élémentaires. (A methodology for computing elementary functions).
PhD thesis, 1985

Discrete Basis and Computation of Elementary Functions.
IEEE Trans. Computers, 1985


  Loading...