Nicolas Brisebarre

	2012
24		Nicolas Brisebarre, Mioara Joldes, Érik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, Ioana Pasca, Laurence Rideau, Laurent Théry: Rigorous Polynomial Approximation Using Taylor Models in Coq. NASA Formal Methods 2012: 85-99
	2011
23		Nicolas Brisebarre, Mioara Joldes, Peter Kornerup, Érik Martin-Dorel, Jean-Michel Muller: Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2). IEEE Symposium on Computer Arithmetic 2011: 23-30
	2010
22		Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé, Serge Torres: Handbook of Floating-Point Arithmetic. Birkhäuser 2010: I-XXIII, 1-572
21		Nicolas Brisebarre, Nicolas Louvet, Érik Martin-Dorel, Jean-Michel Muller, Adrien Panhaleux, Milos D. Ercegovac: Implementing decimal floating-point arithmetic through binary: Some suggestions. ASAP 2010: 317-320
20		Nicolas Brisebarre, Mioara Joldes: Chebyshev interpolation polynomial-based tools for rigorous computing. ISSAC 2010: 147-154
	2008
19		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
18		Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller: Integer and floating-point constant multipliers for FPGAs. ASAP 2008: 239-244
17		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
16		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. IACR Cryptology ePrint Archive 2008: 115 (2008)
15		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)
14		Nicolas Brisebarre, Jean-Michel Muller: Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Trans. Computers 57(2): 165-174 (2008)
	2007
13		Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto: Arithmetic Operators for Pairing-Based Cryptography. CHES 2007: 239-255
12		Nicolas Brisebarre, Sylvain Chevillard: Efficient polynomial L-approximations. IEEE Symposium on Computer Arithmetic 2007: 169-176
11		Nicolas Brisebarre, Guillaume Hanrot: Floating-point L2-approximations to functions. IEEE Symposium on Computer Arithmetic 2007: 177-186
10		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
9		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. IACR Cryptology ePrint Archive 2007: 417 (2007)
8		Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto: A Coprocessor for the Final Exponentiation of the etaT Pairing in Characteristic Three. IACR Cryptology ePrint Archive 2007: 45 (2007)
7		Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto: Arithmetic Operators for Pairing-Based Cryptography. IACR Cryptology ePrint Archive 2007: 91 (2007)
6		Nicolas Brisebarre, Jean-Michel Muller: Correct rounding of algebraic functions. ITA 41(1): 71-83 (2007)
	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	[7] [8] [9] [10] [13] [15] [16] [17]
2	Sylvain Chevillard	[12] [19]
3	David Defour	[3]
4	Jérémie Detrey	[7] [9] [13] [15] [16] [17]
5	Florent de Dinechin	[18] [22]
6	Milos D. Ercegovac	[19] [21]
7	Guillaume Hanrot	[11]
8	Claude-Pierre Jeannerod	[22]
9	Mioara Joldes	[20] [23] [24]
10	Peter Kornerup	[3] [23]
11	Vincent Lefèvre	[22]
12	Nicolas Louvet	[21]
13	Érik Martin-Dorel	[21] [23] [24]
14	Micaela Mayero	[24]
15	Guillaume Melquiond	[22]
16	Jean-Michel Muller	[1] [2] [3] [4] [5] [6] [14] [18] [19] [21] [22] [23] [24]
17	Eiji Okamoto	[7] [8] [9] [10] [13] [15] [16] [17]
18	Adrien Panhaleux	[21]
19	Ioana Pasca	[24]
20	Saurabh Kumar Raina	[2]
21	Nathalie Revol	[3] [22]
22	Laurence Rideau	[24]
23	Francisco Rodríguez-Henríquez	[16] [17]
24	Masaaki Shirase	[8] [9] [10] [15]
25	Damien Stehlé	[22]
26	Tsuyoshi Takagi	[8] [9] [10] [15]
27	Laurent Théry	[24]
28	Arnaud Tisserand	[5]
29	Serge Torres	[19] [22]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page