- Accelerating Correctly Rounded Floating-Point Division When the Divisor is Known in Advance
- A New Range-Reduction Algorithm Nicolas Brisebarre, David Defour, Peter Kornerup, Member, IEEE,
- Functions approximable by E-fractions Nicolas Brisebarre1 Jean-Michel Muller2
- Integer and Floating-Point Constant Multipliers for FPGAs Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller
- Chebyshev Interpolation Polynomial-based Tools for Rigorous Computing
- A Coprocessor for the Final Exponentiation of the T Pairing in Characteristic Three
- IEEE TRANSACTIONS ON COMPUTERS (TO APPEAR) 1 Correctly rounded multiplication by arbitrary
- Sparse-Coefficient Polynomial Approximations for Hardware Implementations
- Two methods for computing machine-efficient polynomial approximants
- Arithmetic Operators for Pairing-Based Cryptography
- N o d'ordre : 1903. pr esent ee a
- Correctly rounded multiplication by arbitrary precision constants
- A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F2m and F3m
- > read(Pasrec): > pasrec();
- HARDWARE OPERATORS FOR FUNCTION EVALUATION USING SPARSE-COEFFICIENT POLYNOMIALS
- Computing Machine-Efficient Polynomial Approximations
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F2m and F3m
- Une 'etude de deux probl`emes diophantiens
- Une pr esentation sommaire du livre "A=B" de M. Petkov sek, H. Wilf et D.
- Irrationality Measures of log 2 and / Nicolas Brisebarre
- E ective lower and upper bounds for the Fourier coecients of powers of the modular invariant j
- Functions approximable by E-fractions Nicolas Brisebarre1 Jean-Michel Muller2
- E#ective lower and upper bounds for the Fourier coe#cients of powers of the modular invariant j
- J. Ramanujan Math. Soc. 20, No.4 (2005) 255282 Effective lower and upper bounds for the Fourier
- Encadrements effectifs des coefficients de Fourier des puissances enti`eres de l'invariant
- ALGORITHMS AND ARITHMETIC OPERATORS FOR COMPUTING THE T PAIRING IN CHARACTERISTIC THREE 1 Algorithms and Arithmetic Operators for
- A floating-point library for integer processors C. Bertinb, N. Brisebarrea, B. Dupont de Dinechinb, C.-P. Jeanneroda,
- L'algorithme LLL et certaines de ses applications Nicolas Brisebarre
- Sparse-Coefficient Polynomial Approximations for Hardware Implementations
- A Coprocessor for the Final Exponentiation of the T Pairing in Characteristic Three
- An Efficient Method for Evaluating Polynomial and Rational Function Approximations
- Sur les fonctions enti eres a double pas r ecurrent Nicolas Brisebarre et Laurent Habsieger 1
- UNIVERSIT E BORDEAUX I
- Efficient polynomial L -approximations
- Floating-point L2 -approximations to functions
- Une methode pour produire des approximants polynomiaux efficaces en machine
- Correctly rounded multiplication by arbitrary precision constants Nicolas Brisebarre
- Augmented precision square roots, 2-D norms, and discussion on correctly rounding x2 + y2
- Laboratoire de l'Informatique du Paral cole Normale Suprieure de Lyon
