Search the dblp DataBase

Publications of Author

1. 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]
   
2. 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]
   
3. 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]
   
4. 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]
   
5. 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]
   
6. Nicolas Brisebarre, Guillaume Hanrot
   Floating-point L²-approximations to functions. [Citation Graph (0, 0)][DBLP]
   IEEE Symposium on Computer Arithmetic, 2007, pp:177-186 [Conf]
   
7. Nicolas Brisebarre, Sylvain Chevillard
   Efficient polynomial L-approximations. [Citation Graph (0, 0)][DBLP]
   IEEE Symposium on Computer Arithmetic, 2007, pp:169-176 [Conf]
   
8. Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto
   Arithmetic Operators for Pairing-Based Cryptography. [Citation Graph (0, 0)][DBLP]
   CHES, 2007, pp:239-255 [Conf]
   
9. Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto
   A Coprocessor for the Final Exponentiation of the eta _T Pairing in Characteristic Three. [Citation Graph (0, 0)][DBLP]
   WAIFI, 2007, pp:25-39 [Conf]
   
10. 
    Integer and floating-point constant multipliers for FPGAs. [Citation Graph (, )][DBLP]
    
    
11. 
    An efficient method for evaluating polynomial and rational function approximations. [Citation Graph (, )][DBLP]
    
    
12. 
    A Comparison between Hardware Accelerators for the Modified Tate Pairing over F_2^m and F_3^m. [Citation Graph (, )][DBLP]