Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Michel Muller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j64]Paolo Montuschi, Jean-Michel Muller
, Florent de Dinechin:
Computer Arithmetic: Continuing a Long and Steady Emergence. Computer 55(10): 4-6 (2022)- [j63]Jean-Michel Muller, Laurence Rideau:
Formalization of Double-Word Arithmetic, and Comments on "Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic". ACM Trans. Math. Softw. 48(1): 9:1-9:24 (2022) - [c63]Carlos F. Borges, Claude-Pierre Jeannerod, Jean-Michel Muller:
High-level algorithms for correctly-rounded reciprocal square roots. ARITH 2022: 18-25 - 2021
- [j62]Sylvie Boldo, Christoph Quirin Lauter, Jean-Michel Muller:
Emulating Round-to-Nearest Ties-to-Zero "Augmented" Floating-Point Operations Using Round-to-Nearest Ties-to-Even Arithmetic. IEEE Trans. Computers 70(7): 1046-1058 (2021) - [c62]Jean-Michel Muller:
$a \cdot(x\cdot\ x)$ or $(a\cdot x)\cdot x?$. ARITH 2021: 17-24 - 2020
- [j61]Jean-Michel Muller:
Elementary Functions and Approximate Computing. Proc. IEEE 108(12): 2136-2149 (2020) - [j60]Nicolas Brisebarre, Mioara Joldes, Jean-Michel Muller, Ana-Maria Nanes, Joris Picot:
Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform. ACM Trans. Math. Softw. 46(2): 11:1-11:27 (2020) - [c61]James E. Stine, Milos D. Ercegovac, Jean-Michel Muller:
An Architecture for Improving Variable Radix Real and Complex Division Using Recurrence Division. ACSSC 2020: 529-533 - [c60]Stef Graillat, Vincent Lefèvre, Jean-Michel Muller:
Alternative Split Functions and Dekker's Product. ARITH 2020: 41-47 - [c59]Mioara Joldes, Jean-Michel Muller:
Algorithms for Manipulating Quaternions in Floating-Point Arithmetic. ARITH 2020: 48-55
2010 – 2019
- 2019
- [j59]Nicolas Fabiano, Jean-Michel Muller, Joris Picot:
Algorithms for Triple-Word Arithmetic. IEEE Trans. Computers 68(11): 1573-1583 (2019) - [c58]Vincent Lefèvre, Jean-Michel Muller:
Accurate Complex Multiplication in Floating-Point Arithmetic. ARITH 2019: 23-29 - [c57]Anastasia Volkova, Jean-Michel Muller:
Semi-Automatic Implementation of the Complementary Error Function. ARITH 2019: 167-174 - 2018
- [b4]Jean-Michel Muller, Nicolas Brunie, Florent de Dinechin, Claude-Pierre Jeannerod, Mioara Joldes, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Serge Torres:
Handbook of Floating-Point Arithmetic (2nd Ed.). Springer 2018, ISBN 978-3-319-76525-9 - [c56]Claude-Pierre Jeannerod, Jean-Michel Muller, Paul Zimmermann:
On Various Ways to Split a Floating-Point Number. ARITH 2018: 53-60 - [c55]Nicolas Brisebarre, George A. Constantinides, Milos Ercezovac, Silviu-Ioan Filip, Matei Istoan, Jean-Michel Muller:
A High Throughput Polynomial and Rational Function Approximations Evaluator. ARITH 2018: 99-106 - 2017
- [j58]Claude-Pierre Jeannerod, Peter Kornerup, Nicolas Louvet, Jean-Michel Muller:
Error bounds on complex floating-point multiplication with an FMA. Math. Comput. 86(304): 881-898 (2017) - [j57]Javier Hormigo, Jean-Michel Muller, Stuart F. Oberman, Nathalie Revol, Arnaud Tisserand, Julio Villalba-Moreno:
Introduction to the Special Issue on Computer Arithmetic. IEEE Trans. Computers 66(12): 1991-1993 (2017) - [j56]Sylvie Boldo, Stef Graillat, Jean-Michel Muller:
On the Robustness of the 2Sum and Fast2Sum Algorithms. ACM Trans. Math. Softw. 44(1): 4:1-4:14 (2017) - [j55]Mioara Joldes, Jean-Michel Muller, Valentina Popescu:
Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic. ACM Trans. Math. Softw. 44(2) (2017) - [c54]Claude-Pierre Jeannerod, Jean-Michel Muller:
On the relative error of computing complex square roots in floating-point arithmetic. ACSSC 2017: 737-740 - [c53]Mioara Joldes, Jean-Michel Muller, Valentina Popescu:
Implementation and Performance Evaluation of an Extended Precision Floating-Point Arithmetic Library for High-Accuracy Semidefinite Programming. ARITH 2017: 27-34 - [c52]Claude-Pierre Jeannerod, Jean-Michel Muller, Antoine Plet:
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. ARITH 2017: 66-73 - [c51]Arthur Blot, Jean-Michel Muller, Laurent Théry:
Formal Correctness of Comparison Algorithms Between Binary64 and Decimal64 Floating-Point Numbers. NSV@CAV 2017: 25-37 - [c50]Sylvie Boldo, Mioara Joldes, Jean-Michel Muller, Valentina Popescu:
Formal Verification of a Floating-Point Expansion Renormalization Algorithm. ITP 2017: 98-113 - 2016
- [j54]Paolo Montuschi, Jean-Michel Muller:
Modern Computer Arithmetic. Computer 49(9): 12 (2016) - [j53]Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Antoine Plet:
Sharp error bounds for complex floating-point inversion. Numer. Algorithms 73(3): 735-760 (2016) - [j52]Mioara Joldes, Olivier Marty, Jean-Michel Muller, Valentina Popescu:
Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions. IEEE Trans. Computers 65(4): 1197-1210 (2016) - [j51]Nicolas Brisebarre, Christoph Quirin Lauter, Marc Mezzarobba, Jean-Michel Muller:
Comparison between Binary and Decimal Floating-Point Numbers. IEEE Trans. Computers 65(7): 2032-2044 (2016) - [c49]Jean-Michel Muller, Valentina Popescu, Ping Tak Peter Tang:
A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions. ARITH 2016: 39-46 - [c48]Julien Le Maire, Nicolas Brunie, Florent de Dinechin, Jean-Michel Muller:
Computing floating-point logarithms with fixed-point operations. ARITH 2016: 156-163 - [c47]Caroline Collange, Mioara Joldes, Jean-Michel Muller, Valentina Popescu:
Parallel floating-point expansions for extended-precision GPU computations. ASAP 2016: 139-146 - [c46]Mioara Joldes, Jean-Michel Muller, Valentina Popescu, Warwick Tucker:
CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications. ICMS 2016: 232-240 - 2015
- [j50]Stef Graillat, Vincent Lefèvre, Jean-Michel Muller:
On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic. Numer. Algorithms 70(3): 653-667 (2015) - [j49]Jean-Michel Muller:
On the Error of Computing ab+cd using Cornea, Harrison and Tang's Method. ACM Trans. Math. Softw. 41(2): 7:1-7:8 (2015) - 2014
- [j48]Amparo Gil, Jean-Michel Muller, Javier Segura:
Preface to the special issue on Numerical Software: Design, Analysis and Verification. Sci. Comput. Program. 90: 1 (2014) - [j47]Dong Wang, Jean-Michel Muller, Nicolas Brisebarre, Milos D. Ercegovac:
(M, p, k)-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function. IEEE Trans. Circuits Syst. II Express Briefs 61-II(9): 711-715 (2014) - [c45]Mioara Joldes, Jean-Michel Muller, Valentina Popescu:
On the computation of the reciprocal of floating point expansions using an adapted Newton-Raphson iteration. ASAP 2014: 63-67 - [i5]Stef Graillat, Vincent Lefèvre, Jean-Michel Muller:
On the maximum relative error when computing x^n in floating-point arithmetic. CoRR abs/1402.2991 (2014) - 2013
- [j46]Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller:
Further analysis of Kahan's algorithm for the accurate computation of 2×2 determinants. Math. Comput. 82(284): 2245-2264 (2013) - [j45]Florent de Dinechin, Christoph Quirin Lauter, Jean-Michel Muller, Serge Torres:
On Ziv's rounding test. ACM Trans. Math. Softw. 39(4): 25:1-25:19 (2013) - [c44]Jean-Michel Muller:
Avoiding double roundings in scaled Newton-Raphson division. ACSSC 2013: 396-399 - [c43]Olga Kupriianova, Christoph Quirin Lauter, Jean-Michel Muller:
Radix conversion for IEEE754-2008 mixed radix floating-point arithmetic. ACSSC 2013: 1134-1138 - [c42]Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller:
On the Componentwise Accuracy of Complex Floating-Point Division with an FMA. IEEE Symposium on Computer Arithmetic 2013: 83-90 - [c41]Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller, Christoph Quirin Lauter:
Comparison between Binary64 and Decimal64 Floating-Point Numbers. IEEE Symposium on Computer Arithmetic 2013: 145-152 - [i4]Olga Kupriianova, Christoph Quirin Lauter, Jean-Michel Muller:
Radix Conversion for IEEE754-2008 Mixed Radix Floating-Point Arithmetic. CoRR abs/1312.0455 (2013) - 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) - [c40]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 - [c39]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) - [c38]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 - [c37]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
- [b3]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): 4:1-4:23 (2010) - [j39]Milos D. Ercegovac, Jean-Michel Muller:
An Efficient Method for Evaluating Complex Polynomials. J. Signal Process. Syst. 58(1): 17-27 (2010) - [c36]Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux:
Newton-Raphson algorithms for floating-point division using an FMA. ASAP 2010: 200-207 - [c35]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 - [c34]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
2000 – 2009
- 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) - [c33]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 - [c32]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) - [c31]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 - [c30]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. RAIRO Theor. Informatics Appl. 41(1): 71-83 (2007) - [j34]Florent de Dinechin, Christoph Quirin Lauter, Jean-Michel Muller:
Fast and correctly rounded logarithms in double-precision. RAIRO Theor. Informatics Appl. 41(1): 85-102 (2007) - [j33]Milos D. Ercegovac, Jean-Michel Muller:
Complex Square Root with Operand Prescaling. J. VLSI Signal Process. 49(1): 19-30 (2007) - [c29]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
- [b2]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) - [c28]Nicolas Brisebarre, Jean-Michel Muller:
Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Symposium on Computer Arithmetic 2005: 13-20 - [c27]Sylvie Boldo, Jean-Michel Muller:
Some Functions Computable with a Fused-Mac. IEEE Symposium on Computer Arithmetic 2005: 52-58 - [c26]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 - [c25]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 - [c24]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. Numer. 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) - [c23]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. J. VLSI Signal Process. 33(1-2): 31-35 (2003) - [c22]Jean-Michel Muller:
"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods. IEEE Symposium on Computer Arithmetic 2003: 114-121 - [c21]Jean-Michel Muller:
Complex Division with Prescaling of Operands. ASAP 2003: 304-314 - [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
- [c20]Tomás Lang, Jean-Michel Muller:
Bounds on Runs of Zeros and Ones for Algebraic Functions. IEEE Symposium on Computer Arithmetic 2001: 13- - [c19]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- - [c18]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 - [c17]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. Des. Autom. Embed. Syst. 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. J. VLSI Signal Process. 25(2): 179-186 (2000)
1990 – 1999
- 1999
- [j18]Jean-Michel Muller:
A Few Results on Table-Based Methods. Reliab. Comput. 5(3): 279-288 (1999) - [j17]Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller:
Foreword: Real Numbers and Computers. Theor. Comput. Sci. 210(1): 1-2 (1999) - 1998
- [j16]Jean-Michel Muller:
Foreword to the special issue. J. Univers. Comput. Sci. 4(1): 1 (1998) - [j15]Jean-Michel Muller:
Foreword to the special issue. J. Univers. Comput. Sci. 4(2): 89 (1998) - [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. J. VLSI Signal Process. 19(2): 167-178 (1998) - [c16]Jean-Michel Muller:
A Few Results on Table-Based Methods. SCAN 1998: 279-288 - 1997
- [c15]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) - [c14]Jean-Claude Bajard, Laurent-Stéphane Didier, Jean-Michel Muller:
A New Euclidean Division Algorithm For Residue Number Systems. ASAP 1996: 45-54 - [c13]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. Univers. Comput. Sci. 1(3): 162-175 (1995) - [j9]