The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Michel Muller: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  50. On the Computation of Correctly-Rounded Sums. [Citation Graph (, )][DBLP]


  51. BKM: A new hardware algorithm for complex elementary functions. [Citation Graph (, )][DBLP]


  52. Fast evaluation of polynomials and inverses of polynomials. [Citation Graph (, )][DBLP]


  53. A Hardware-Oriented Method for Evaluating Complex Polynomials. [Citation Graph (, )][DBLP]


  54. Integer and floating-point constant multipliers for FPGAs. [Citation Graph (, )][DBLP]


  55. An efficient method for evaluating polynomial and rational function approximations. [Citation Graph (, )][DBLP]


  56. Design and Implementation of a Radix-4 Complex Division Unit with Prescaling. [Citation Graph (, )][DBLP]


Search in 0.390secs, Finished in 0.393secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002