| 2012 | ||
|---|---|---|
| j44 | Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller: On the Computation of Correctly Rounded Sums. IEEE Trans. Computers 61(3): 289-298 (2012) | |
| c37 | Nicolas Brisebarre, Milos D. Ercegovac, Jean-Michel Muller: (M, p, k)-Friendly Points: A Table-Based Method for Trigonometric Function Evaluation. ASAP 2012: 46-52 | |
| c36 | Nicolas Brisebarre, Mioara Joldes, Érik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, Ioana Pasca, Laurence Rideau, Laurent Théry: Rigorous Polynomial Approximation Using Taylor Models in Coq. NASA Formal Methods 2012: 85-99 | |
| i3 | Peter Kornerup, Jean-Michel Muller, Adrien Panhaleux: Floating-Point Arithmetic on Round-to-Nearest Representations. CoRR abs/1201.3914 (2012) | |
| 2011 | ||
| j43 | Sylvie Boldo, Jean-Michel Muller: Exact and Approximated Error of the FMA. IEEE Trans. Computers 60(2): 157-164 (2011) | |
| j42 | Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux: Midpoints and Exact Points of Some Algebraic Functions in Floating-Point Arithmetic. IEEE Trans. Computers 60(2): 228-241 (2011) | |
| j41 | Peter Kornerup, Jean-Michel Muller, Adrien Panhaleux: Performing Arithmetic Operations on Round-to-Nearest Representations. IEEE Trans. Computers 60(2): 282-291 (2011) | |
| c35 | Nicolas Brisebarre, Mioara Joldes, Peter Kornerup, Érik Martin-Dorel, Jean-Michel Muller: Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2). IEEE Symposium on Computer Arithmetic 2011: 23-30 | |
| c34 | Florent de Dinechin, Jean-Michel Muller, Bogdan Pasca, Alexandru Plesco: An FPGA architecture for solving the Table Maker's Dilemma. ASAP 2011: 187-194 | |
| 2010 | ||
| b2 | Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé, Serge Torres: Handbook of Floating-Point Arithmetic. Birkhäuser 2010, isbn 978-0-8176-4704-9, pp. I-XXIII, 1-572 | |
| j40 | 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) (2010) | |
| j39 | Milos D. Ercegovac, Jean-Michel Muller: An Efficient Method for Evaluating Complex Polynomials. Signal Processing Systems 58(1): 17-27 (2010) | |
| c33 | Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux: Newton-Raphson algorithms for floating-point division using an FMA. ASAP 2010: 200-207 | |
| c32 | Nicolas Brisebarre, Nicolas Louvet, Érik Martin-Dorel, Jean-Michel Muller, Adrien Panhaleux, Milos D. Ercegovac: Implementing decimal floating-point arithmetic through binary: Some suggestions. ASAP 2010: 317-320 | |
| c31 | Claude-Pierre Jeannerod, Christophe Mouilleron, Jean-Michel Muller, Guillaume Revy, Christian Bertin, Jingyan Jourdan-Lu, Herve Knochel, Christophe Monat: Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors. PASCO 2010: 1-9 | |
| 2009 | ||
| j38 | 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) | |
| c30 | Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller: On the Computation of Correctly-Rounded Sums. IEEE Symposium on Computer Arithmetic 2009: 155-160 | |
| c29 | Pouya Dormiani, Milos D. Ercegovac, Jean-Michel Muller: Design and Implementation of a Radix-4 Complex Division Unit with Prescaling. ASAP 2009: 83-90 | |
| 2008 | ||
| j37 | Nicolas Brisebarre, Jean-Michel Muller: Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Trans. Computers 57(2): 165-174 (2008) | |
| j36 | Jean-Luc Beuchat, Jean-Michel Muller: Automatic Generation of Modular Multipliers for FPGA Applications. IEEE Trans. Computers 57(12): 1600-1613 (2008) | |
| c28 | 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 | |
| c27 | Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller: Integer and floating-point constant multipliers for FPGAs. ASAP 2008: 239-244 | |
| p1 | Florent de Dinechin, Milos D. Ercegovac, Jean-Michel Muller, Nathalie Revol: Digital Arithmetic. Wiley Encyclopedia of Computer Science and Engineering 2008 | |
| 2007 | ||
| j35 | Nicolas Brisebarre, Jean-Michel Muller: Correct rounding of algebraic functions. ITA 41(1): 71-83 (2007) | |
| j34 | Florent de Dinechin, Christoph Quirin Lauter, Jean-Michel Muller: Fast and correctly rounded logarithms in double-precision. ITA 41(1): 85-102 (2007) | |
| j33 | Milos D. Ercegovac, Jean-Michel Muller: Complex Square Root with Operand Prescaling. VLSI Signal Processing 49(1): 19-30 (2007) | |
| c26 | Milos D. Ercegovac, Jean-Michel Muller: A Hardware-Oriented Method for Evaluating Complex Polynomials. ASAP 2007: 122-127 | |
| i2 | Peter Kornerup, Vincent Lefèvre, Jean-Michel Muller: Computing Integer Powers in Floating-Point Arithmetic. CoRR abs/0705.4369 (2007) | |
| 2006 | ||
| b1 | Jean-Michel Muller: Elementary functions - algorithms and implementation (2. ed.). Birkhäuser 2006, isbn 978-0-8176-4372-0, pp. I-XXII, 1-265 | |
| j32 | Peter Kornerup, Jean-Michel Muller: Leading Guard Digits in Finite Precision Redundant Representations. IEEE Trans. Computers 55(5): 541-548 (2006) | |
| j31 | Peter Kornerup, Jean-Michel Muller: Choosing starting values for certain Newton-Raphson iterations. Theor. Comput. Sci. 351(1): 101-110 (2006) | |
| j30 | Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand: Computing machine-efficient polynomial approximations. ACM Trans. Math. Softw. 32(2): 236-256 (2006) | |
| 2005 | ||
| j29 | 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) | |
| j28 | Nicolas Brisebarre, David Defour, Peter Kornerup, Jean-Michel Muller, Nathalie Revol: A New Range-Reduction Algorithm. IEEE Trans. Computers 54(3): 331-339 (2005) | |
| c25 | Nicolas Brisebarre, Jean-Michel Muller: Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Symposium on Computer Arithmetic 2005: 13-20 | |
| c24 | Sylvie Boldo, Jean-Michel Muller: Some Functions Computable with a Fused-Mac. IEEE Symposium on Computer Arithmetic 2005: 52-58 | |
| c23 | 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 | |
| c22 | 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 | |
| c21 | Milos D. Ercegovac, Jean-Michel Muller: Variable Radix Real and Complex Digit-Recurrence Division. ASAP 2005: 316-321 | |
| 2004 | ||
| j27 | David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, Paul Zimmermann: Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. Numerical Algorithms 37(1-4): 367-375 (2004) | |
| j26 | 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) | |
| c20 | Milos D. Ercegovac, Jean-Michel Muller: Complex Square Root with Operand Prescaling. ASAP 2004: 52-62 | |
| 2003 | ||
| j25 | Peter Kornerup, Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller: Preface. Theor. Comput. Sci. 291(2): 133-134 (2003) | |
| j24 | Vincent Lefèvre, Jean-Michel Muller: On-the-Fly Range Reduction. VLSI Signal Processing 33(1-2): 31-35 (2003) | |
| c19 | Jean-Michel Muller: "Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods. IEEE Symposium on Computer Arithmetic 2003: 114-121 | |
| c18 | ||
| i1 | Nicolas Brisebarre, Jean-Michel Muller: Finding the "truncated" polynomial that is closest to a function. CoRR cs.MS/0307009 (2003) | |
| 2002 | ||
| j23 | Jean Marie Chesneaux, Christiane Frougny, Jean-Michel Muller: Real Numbers - Foreword. Theor. Comput. Sci. 279(1-2): 1-2 (2002) | |
| 2001 | ||
| c17 | Tomás Lang, Jean-Michel Muller: Bounds on Runs of Zeros and Ones for Algebraic Functions. IEEE Symposium on Computer Arithmetic 2001: 13- | |
| c16 | 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- | |
| c15 | 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 | |
| c14 | 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 | |
| 2000 | ||
| j22 | Anne Mignotte, Jean-Michel Muller, Olivier Peyran: Synthesis for Mixed Arithmetic. Design Autom. for Emb. Sys. 5(1): 29-60 (2000) | |
| j21 | 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) | |
| j20 | 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) | |
| j19 | 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 | ||
| j18 | ||
| j17 | Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller: Foreword: Real Numbers and Computers. Theor. Comput. Sci. 210(1): 1-2 (1999) | |
| 1998 | ||
| j16 | ||
| j15 | ||
| j14 | Jean-Michel Muller, Alexandre Scherbyna, Arnaud Tisserand: Semi-Logarithmic Number Systems. IEEE Trans. Computers 47(2): 145-151 (1998) | |
| j13 | Vincent Lefèvre, Jean-Michel Muller, Arnaud Tisserand: Toward Correctly Rounded Transcendentals. IEEE Trans. Computers 47(11): 1235-1243 (1998) | |
| j12 | 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 | ||
| c13 | Vincent Lefèvre, Arnaud Tisserand, Jean-Michel Muller: Towards Correctly Rounded Transcendentals. IEEE Symposium on Computer Arithmetic 1997: 132- | |
| 1996 | ||
| j11 | 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) | |
| c12 | Jean-Claude Bajard, Laurent-Stéphane Didier, Jean-Michel Muller: A New Euclidean Division Algorithm For Residue Number Systems. ASAP 1996: 45-54 | |
| c11 | Asger Munk Nielsen, Jean-Michel Muller: On-Line Algorithms for Computing Exponentials and Logarithms. Euro-Par, Vol. II 1996: 165-174 | |
| 1995 | ||
| j10 | 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) | |
| j9 | 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) | |
| c10 | Jean-Michel Muller, Arnaud Tisserand, Alexandre Scherbyna: Semi-Logarithmic Number Systems. IEEE Symposium on Computer Arithmetic 1995: 201-207 | |
| 1994 | ||
| j8 | 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) | |
| j7 | Jean-Michel Muller: Some Characterizations of Functions Computable in On-Line Arithmetic. IEEE Trans. Computers 43(6): 752-755 (1994) | |
| j6 | 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) | |
| c9 | Marc Daumas, Jean-Michel Muller, Jean Vuillemin: Implementing On Line Arithmetic on PAM. FPL 1994: 196-207 | |
| 1993 | ||
| j5 | Christophe Mazenc, Xavier Merrheim, Jean-Michel Muller: Computing Functions cos^{-1} and sin^{-1} Using Cordic. IEEE Trans. Computers 42(1): 118-122 (1993) | |
| j4 | Jean Duprat, Jean-Michel Muller: The CORDIC Algorithm: New Results for Fast VLSI Implementation. IEEE Trans. Computers 42(2): 168-178 (1993) | |
| c8 | 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 | |
| c7 | Xavier Merrheim, Jean-Michel Muller, Hong-Jin Yeh: Fast evaluation of polynomials and inverses of polynomials. IEEE Symposium on Computer Arithmetic 1993: 186-192 | |
| c6 | 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 | |
| 1991 | ||
| c5 | Jean-Michel Muller: On-line computing: a survey and some new results. Algorithms and Parallel VLSI Architectures 1991: 261-272 | |
| c4 | 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 | |
| 1989 | ||
| c3 | Alain Guyot, Yvan Herreros, Jean-Michel Muller: JANUS, an on-line multiplier/divider for manipulating large numbers. IEEE Symposium on Computer Arithmetic 1989: 106-111 | |
| c2 | Jean Duprat, Yvan Herreros, Jean-Michel Muller: Some results about on-line computation of functions. IEEE Symposium on Computer Arithmetic 1989: 112-118 | |
| 1988 | ||
| j3 | Jean Duprat, Jean-Michel Muller: Hardwired Polynomial Evaluation. J. Parallel Distrib. Comput. 5(3): 291-309 (1988) | |
| 1987 | ||
| j2 | Alain Guyot, Bertrand Hochet, Jean-Michel Muller: A Way to Build Efficient Carry-Skip Adders. IEEE Trans. Computers 36(10): 1144-1152 (1987) | |
| c1 | Michel Cosnard, Alain Guyot, Bertrand Hochet, Jean-Michel Muller, H. Ouaouicha, P. Paul, E. Zysman: The FELIN arithmetic coprocessor chip. IEEE Symposium on Computer Arithmetic 1987: 107-112 | |
| 1985 | ||
| j1 | Jean-Michel Muller: Discrete Basis and Computation of Elementary Functions. IEEE Trans. Computers 34(9): 857-862 (1985) | |
Colors in the list of coauthors
Last update Sat May 25 19:05:18 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page