Nicolas Brisebarre

	2008
14		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
13		Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller: Integer and floating-point constant multipliers for FPGAs. ASAP 2008: 239-244
12		Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez: A Comparison between Hardware Accelerators for the Modified Tate Pairing over F2m and F3m. Pairing 2008: 297-315
11		Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, Tsuyoshi Takagi: Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three. IEEE Trans. Computers 57(11): 1454-1468 (2008)
10		Nicolas Brisebarre, Jean-Michel Muller: Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Trans. Computers 57(2): 165-174 (2008)
	2007
9		Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto: Arithmetic Operators for Pairing-Based Cryptography. CHES 2007: 239-255
8		Nicolas Brisebarre, Sylvain Chevillard: Efficient polynomial L-approximations. IEEE Symposium on Computer Arithmetic 2007: 169-176
7		Nicolas Brisebarre, Guillaume Hanrot: Floating-point L2-approximations to functions. IEEE Symposium on Computer Arithmetic 2007: 177-186
6		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. WAIFI 2007: 25-39
	2006
5		Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand: Computing machine-efficient polynomial approximations. ACM Trans. Math. Softw. 32(2): 236-256 (2006)
	2005
4		Nicolas Brisebarre, Jean-Michel Muller: Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Symposium on Computer Arithmetic 2005: 13-20
3		Nicolas Brisebarre, David Defour, Peter Kornerup, Jean-Michel Muller, Nathalie Revol: A New Range-Reduction Algorithm. IEEE Trans. Computers 54(3): 331-339 (2005)
	2004
2		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)
	2003
1		Nicolas Brisebarre, Jean-Michel Muller: Finding the "truncated" polynomial that is closest to a function CoRR cs.MS/0307009: (2003)

Coauthor Index

1	Jean-Luc Beuchat	[6] [9] [11] [12]
2	Sylvain Chevillard	[8] [14]
3	David Defour	[3]
4	Jérémie Detrey	[9] [11] [12]
5	Florent de Dinechin	[13]
6	Milos D. Ercegovac	[14]
7	Guillaume Hanrot	[7]
8	Peter Kornerup	[3]
9	Jean-Michel Muller	[1] [2] [3] [4] [5] [10] [13] [14]
10	Eiji Okamoto	[6] [9] [11] [12]
11	Saurabh Kumar Raina	[2]
12	Nathalie Revol	[3]
13	Francisco Rodríguez-Henríquez	[12]
14	Masaaki Shirase	[6] [11]
15	Tsuyoshi Takagi	[6] [11]
16	Arnaud Tisserand	[5]
17	Serge Torres	[14]

Colors in the list of coauthors