| 2009 |
|---|
| 62 | EE | Peter Kornerup,
Paolo Montuschi,
Jean-Michel Muller,
Eric Schwarz:
Guest Editors' Introduction: Special Section on Computer Arithmetic.
IEEE Trans. Computers 58(2): 145-147 (2009) |
| 2008 |
|---|
| 61 | EE | Nicolas Brisebarre,
Sylvain Chevillard,
Milos D. Ercegovac,
Jean-Michel Muller,
Serge Torres:
An efficient method for evaluating polynomial and rational function approximations.
ASAP 2008: 233-238 |
| 60 | EE | Nicolas Brisebarre,
Florent de Dinechin,
Jean-Michel Muller:
Integer and floating-point constant multipliers for FPGAs.
ASAP 2008: 239-244 |
| 59 | EE | Florent de Dinechin,
Milos D. Ercegovac,
Jean-Michel Muller,
Nathalie Revol:
Digital Arithmetic.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
| 58 | EE | Jean-Luc Beuchat,
Jean-Michel Muller:
Automatic Generation of Modular Multipliers for FPGA Applications.
IEEE Trans. Computers 57(12): 1600-1613 (2008) |
| 57 | EE | Nicolas Brisebarre,
Jean-Michel Muller:
Correctly Rounded Multiplication by Arbitrary Precision Constants.
IEEE Trans. Computers 57(2): 165-174 (2008) |
| 2007 |
|---|
| 56 | EE | Milos D. Ercegovac,
Jean-Michel Muller:
A Hardware-Oriented Method for Evaluating Complex Polynomials.
ASAP 2007: 122-127 |
| 55 | EE | Peter Kornerup,
Vincent Lefèvre,
Jean-Michel Muller:
Computing Integer Powers in Floating-Point Arithmetic
CoRR abs/0705.4369: (2007) |
| 54 | EE | Milos D. Ercegovac,
Jean-Michel Muller:
Complex Square Root with Operand Prescaling.
VLSI Signal Processing 49(1): 19-30 (2007) |
| 2006 |
|---|
| 53 | EE | Nicolas Brisebarre,
Jean-Michel Muller,
Arnaud Tisserand:
Computing machine-efficient polynomial approximations.
ACM Trans. Math. Softw. 32(2): 236-256 (2006) |
| 52 | EE | Peter Kornerup,
Jean-Michel Muller:
Leading Guard Digits in Finite Precision Redundant Representations.
IEEE Trans. Computers 55(5): 541-548 (2006) |
| 51 | EE | Peter Kornerup,
Jean-Michel Muller:
Choosing starting values for certain Newton-Raphson iterations.
Theor. Comput. Sci. 351(1): 101-110 (2006) |
| 2005 |
|---|
| 50 | EE | Jean-Luc Beuchat,
Jean-Michel Muller:
Multiplication Algorithms for Radix-2 RN-Codings and Two's Complement Multiplication Algorithms for Radix-2 RN-Codings and Two's Complement.
ASAP 2005: 303-308 |
| 49 | EE | Milos D. Ercegovac,
Jean-Michel Muller:
Variable Radix Real and Complex Digit-Recurrence Division.
ASAP 2005: 316-321 |
| 48 | EE | Jean-Michel Muller,
Arnaud Tisserand,
Benoît Dupont de Dinechin,
Christophe Monat:
Division by Constant for the ST100 DSP Microprocessor.
IEEE Symposium on Computer Arithmetic 2005: 124-130 |
| 47 | EE | Nicolas Brisebarre,
Jean-Michel Muller:
Correctly Rounded Multiplication by Arbitrary Precision Constants.
IEEE Symposium on Computer Arithmetic 2005: 13-20 |
| 46 | EE | Sylvie Boldo,
Jean-Michel Muller:
Some Functions Computable with a Fused-Mac.
IEEE Symposium on Computer Arithmetic 2005: 52-58 |
| 45 | EE | José-Alejandro Piñeiro,
Stuart F. Oberman,
Jean-Michel Muller,
Javier D. Bruguera:
High-Speed Function Approximation Using a Minimax Quadratic Interpolator.
IEEE Trans. Computers 54(3): 304-318 (2005) |
| 44 | EE | Nicolas Brisebarre,
David Defour,
Peter Kornerup,
Jean-Michel Muller,
Nathalie Revol:
A New Range-Reduction Algorithm.
IEEE Trans. Computers 54(3): 331-339 (2005) |
| 2004 |
|---|
| 43 | EE | Milos D. Ercegovac,
Jean-Michel Muller:
Complex Square Root with Operand Prescaling.
ASAP 2004: 52-62 |
| 42 | EE | Nicolas Brisebarre,
Jean-Michel Muller,
Saurabh Kumar Raina:
Accelerating Correctly Rounded Floating-Point Division when the Divisor Is Known in Advance.
IEEE Trans. Computers 53(8): 1069-1072 (2004) |
| 2003 |
|---|
| 41 | EE | Jean-Michel Muller:
Complex Division with Prescaling of Operands.
ASAP 2003: 304-314 |
| 40 | EE | Jean-Michel Muller:
"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods.
IEEE Symposium on Computer Arithmetic 2003: 114-121 |
| 39 | EE | Nicolas Brisebarre,
Jean-Michel Muller:
Finding the "truncated" polynomial that is closest to a function
CoRR cs.MS/0307009: (2003) |
| 38 | | Peter Kornerup,
Jean-Claude Bajard,
Christiane Frougny,
Jean-Michel Muller:
Preface.
Theor. Comput. Sci. 291(2): 133-134 (2003) |
| 37 | EE | Vincent Lefèvre,
Jean-Michel Muller:
On-the-Fly Range Reduction.
VLSI Signal Processing 33(1-2): 31-35 (2003) |
| 2002 |
|---|
| 36 | EE | Jean Marie Chesneaux,
Christiane Frougny,
Jean-Michel Muller:
Real Numbers - Foreword.
Theor. Comput. Sci. 279(1-2): 1-2 (2002) |
| 2001 |
|---|
| 35 | EE | José-Alejandro Piñeiro,
Javier D. Bruguera,
Jean-Michel Muller:
FPGA Implementation of a Faithful Polynomial Approximation for Powering Function Computation.
DSD 2001: 262-269 |
| 34 | EE | Vincent Lefèvre,
Jean-Michel Muller:
Worst Cases for Correct Rounding of the Elementary Functions in Double Precision.
IEEE Symposium on Computer Arithmetic 2001: 111-118 |
| 33 | EE | Tomás Lang,
Jean-Michel Muller:
Bounds on Runs of Zeros and Ones for Algebraic Functions.
IEEE Symposium on Computer Arithmetic 2001: 13- |
| 32 | EE | José-Alejandro Piñeiro,
Javier D. Bruguera,
Jean-Michel Muller:
Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree.
IEEE Symposium on Computer Arithmetic 2001: 40- |
| 2000 |
|---|
| 31 | EE | Milos D. Ercegovac,
Tomás Lang,
Jean-Michel Muller,
Arnaud Tisserand:
Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers.
IEEE Trans. Computers 49(7): 628-637 (2000) |
| 30 | EE | Milos D. Ercegovac,
Laurent Imbert,
David W. Matula,
Jean-Michel Muller,
Guoheng Wei:
Improving Goldschmidt Division, Square Root, and Square Root Reciprocal.
IEEE Trans. Computers 49(7): 759-763 (2000) |
| 29 | EE | Laurent Imbert,
Jean-Michel Muller,
F. Rico:
A Radix-10 BKM Algorithm for Computing Transcendentals on Pocket Computers.
VLSI Signal Processing 25(2): 179-186 (2000) |
| 1999 |
|---|
| 28 | EE | Jean-Michel Muller:
A Few Results on Table-Based Methods.
Reliable Computing 5(3): 279-288 (1999) |
| 27 | EE | Jean-Claude Bajard,
Christiane Frougny,
Jean-Michel Muller:
Foreword: Real Numbers and Computers.
Theor. Comput. Sci. 210(1): 1-2 (1999) |
| 1998 |
|---|
| 26 | | Vincent Lefèvre,
Jean-Michel Muller,
Arnaud Tisserand:
Toward Correctly Rounded Transcendentals.
IEEE Trans. Computers 47(11): 1235-1243 (1998) |
| 25 | | Jean-Michel Muller,
Alexandre Scherbyna,
Arnaud Tisserand:
Semi-Logarithmic Number Systems.
IEEE Trans. Computers 47(2): 145-151 (1998) |
| 24 | EE | Jean-Michel Muller:
Foreword to the special issue.
J. UCS 4(1): 1 (1998) |
| 23 | EE | Jean-Michel Muller:
Foreword to the special issue.
J. UCS 4(2): 89 (1998) |
| 22 | EE | Jean-Claude Bajard,
Laurent-Stéphane Didier,
Jean-Michel Muller:
A New Euclidean Division Algorithm for Residue Number Systems.
VLSI Signal Processing 19(2): 167-178 (1998) |
| 1997 |
|---|
| 21 | EE | Vincent Lefèvre,
Arnaud Tisserand,
Jean-Michel Muller:
Towards Correctly Rounded Transcendentals.
IEEE Symposium on Computer Arithmetic 1997: 132- |
| 1996 |
|---|
| 20 | EE | Jean-Claude Bajard,
Laurent-Stéphane Didier,
Jean-Michel Muller:
A New Euclidean Division Algorithm For Residue Number Systems.
ASAP 1996: 45-54 |
| 19 | | Asger Munk Nielsen,
Jean-Michel Muller:
On-Line Algorithms for Computing Exponentials and Logarithms.
Euro-Par, Vol. II 1996: 165-174 |
| 18 | | Jean-Claude Bajard,
Christiane Frougny,
Jean-Michel Muller,
Gilles Villard:
Forword to the Special Issue on Real Numbers and Computers.
Theor. Comput. Sci. 162(1): 1-3 (1996) |
| 1995 |
|---|
| 17 | EE | Jean-Michel Muller,
Arnaud Tisserand,
Alexandre Scherbyna:
Semi-Logarithmic Number Systems.
IEEE Symposium on Computer Arithmetic 1995: 201-207 |
| 16 | EE | Marc Daumas,
Christophe Mazenc,
Xavier Merrheim,
Jean-Michel Muller:
Modular Range Reduction: A New Algorithm for Fast and Accurate Computation on the Elementary Functions.
J. UCS 1(3): 162-175 (1995) |
| 15 | EE | Jean-Claude Bajard,
Dominique Michelucci,
Jean-Michel Moreau,
Jean-Michel Muller:
Introduction to the Special Issue: "Real Numbers and Computers".
J. UCS 1(7): 436-438 (1995) |
| 1994 |
|---|
| 14 | | Marc Daumas,
Jean-Michel Muller,
Jean Vuillemin:
Implementing On Line Arithmetic on PAM.
FPL 1994: 196-207 |
| 13 | | Jean-Michel Muller:
Some Characterizations of Functions Computable in On-Line Arithmetic.
IEEE Trans. Computers 43(6): 752-755 (1994) |
| 12 | | Jean-Claude Bajard,
Sylvanus Kla,
Jean-Michel Muller:
BKM: A New Hardware Algorithm for Complex Elementary Functions.
IEEE Trans. Computers 43(8): 955-963 (1994) |
| 11 | | Jean-Claude Bajard,
Jean Duprat,
Sylvanus Kla,
Jean-Michel Muller:
Some Operators for On-Line Radix-2 Computations.
J. Parallel Distrib. Comput. 22(2): 336-345 (1994) |
| 1993 |
|---|
| 10 | EE | Jean-Claude Bajard,
Sylvanus Kla,
Jean-Michel Muller:
BKM: A new hardware algorithm for complex elementary functions.
IEEE Symposium on Computer Arithmetic 1993: 146-153 |
| 9 | EE | Xavier Merrheim,
Jean-Michel Muller,
Hong-Jin Yeh:
Fast evaluation of polynomials and inverses of polynomials.
IEEE Symposium on Computer Arithmetic 1993: 186-192 |
| 8 | | Ali Skaf,
Jean-Claude Bajard,
Alain Guyot,
Jean-Michel Muller:
A VLSI circuit for on-line polynominal computing: Application to exponential, trigonometric and hyperbolic functions.
VLSI 1993: 93-100 |
| 7 | | Christophe Mazenc,
Xavier Merrheim,
Jean-Michel Muller:
Computing Functions cos^{-1} and sin^{-1} Using Cordic.
IEEE Trans. Computers 42(1): 118-122 (1993) |
| 6 | | Jean Duprat,
Jean-Michel Muller:
The CORDIC Algorithm: New Results for Fast VLSI Implementation.
IEEE Trans. Computers 42(2): 168-178 (1993) |
| 1991 |
|---|
| 5 | | Jean-Michel Muller:
On-line computing: a survey and some new results.
Algorithms and Parallel VLSI Architectures 1991: 261-272 |
| 4 | | Jean Duprat,
Mario Fiallos Aguilar,
Jean-Michel Muller,
Hong-Jin Yeh:
Delays of on-line floating point operators in borrow-save representation.
Algorithms and Parallel VLSI Architectures 1991: 273-278 |
| 1988 |
|---|
| 3 | | Jean Duprat,
Jean-Michel Muller:
Hardwired Polynomial Evaluation.
J. Parallel Distrib. Comput. 5(3): 291-309 (1988) |
| 1987 |
|---|
| 2 | | Alain Guyot,
Bertrand Hochet,
Jean-Michel Muller:
A Way to Build Efficient Carry-Skip Adders.
IEEE Trans. Computers 36(10): 1144-1152 (1987) |
| 1985 |
|---|
| 1 | | Jean-Michel Muller:
Discrete Basis and Computation of Elementary Functions.
IEEE Trans. Computers 34(9): 857-862 (1985) |
