The SCEAS System
| |||||||

## Search the dblp DataBase
Nicolas Brisebarre:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - Nicolas Brisebarre, Guillaume Hanrot
**Floating-point L**[Citation Graph (0, 0)][DBLP]^{2}-approximations to functions. IEEE Symposium on Computer Arithmetic, 2007, pp:177-186 [Conf] - Nicolas Brisebarre, Sylvain Chevillard
**Efficient polynomial L-approximations.**[Citation Graph (0, 0)][DBLP] IEEE Symposium on Computer Arithmetic, 2007, pp:169-176 [Conf] - 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] - Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto
**A Coprocessor for the Final Exponentiation of the**[Citation Graph (0, 0)][DBLP]*eta*_{ T }Pairing in Characteristic Three. WAIFI, 2007, pp:25-39 [Conf] **Integer and floating-point constant multipliers for FPGAs.**[Citation Graph (, )][DBLP]**An efficient method for evaluating polynomial and rational function approximations.**[Citation Graph (, )][DBLP]**A Comparison between Hardware Accelerators for the Modified Tate Pairing over F**[Citation Graph (, )][DBLP]_{2m}and F_{3m}.
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |