| 2012 | ||
|---|---|---|
| c13 | Nicolas Brisebarre, Milos D. Ercegovac, Jean-Michel Muller: (M, p, k)-Friendly Points: A Table-Based Method for Trigonometric Function Evaluation. ASAP 2012: 46-52 | |
| c12 | 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 | |
| i6 | Tamas Györfi, Octavian Cret, Guillaume Hanrot, Nicolas Brisebarre: High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions. IACR Cryptology ePrint Archive 2012: 343 (2012) | |
| 2011 | ||
| c11 | 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 | ||
| b1 | 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, isbn 978-0-8176-4704-9, pp. I-XXIII, 1-572 | |
| c10 | 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 | |
| c9 | Nicolas Brisebarre, Mioara Joldes: Chebyshev interpolation polynomial-based tools for rigorous computing. ISSAC 2010: 147-154 | |
| 2008 | ||
| j7 | Nicolas Brisebarre, Jean-Michel Muller: Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Trans. Computers 57(2): 165-174 (2008) | |
| j6 | 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) | |
| c8 | 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 | |
| c7 | Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller: Integer and floating-point constant multipliers for FPGAs. ASAP 2008: 239-244 | |
| c6 | 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 | |
| i5 | 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) | |
| 2007 | ||
| j5 | Nicolas Brisebarre, Jean-Michel Muller: Correct rounding of algebraic functions. ITA 41(1): 71-83 (2007) | |
| c5 | Nicolas Brisebarre, Sylvain Chevillard: Efficient polynomial L-approximations. IEEE Symposium on Computer Arithmetic 2007: 169-176 | |
| c4 | Nicolas Brisebarre, Guillaume Hanrot: Floating-point L2-approximations to functions. IEEE Symposium on Computer Arithmetic 2007: 177-186 | |
| c3 | Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto: Arithmetic Operators for Pairing-Based Cryptography. CHES 2007: 239-255 | |
| c2 | 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 | |
| i4 | 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) | |
| i3 | Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto: Arithmetic Operators for Pairing-Based Cryptography. IACR Cryptology ePrint Archive 2007: 91 (2007) | |
| i2 | 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) | |
| 2006 | ||
| j4 | Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand: Computing machine-efficient polynomial approximations. ACM Trans. Math. Softw. 32(2): 236-256 (2006) | |
| 2005 | ||
| j3 | Nicolas Brisebarre, David Defour, Peter Kornerup, Jean-Michel Muller, Nathalie Revol: A New Range-Reduction Algorithm. IEEE Trans. Computers 54(3): 331-339 (2005) | |
| c1 | Nicolas Brisebarre, Jean-Michel Muller: Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Symposium on Computer Arithmetic 2005: 13-20 | |
| 2004 | ||
| j2 | 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 | ||
| i1 | Nicolas Brisebarre, Jean-Michel Muller: Finding the "truncated" polynomial that is closest to a function. CoRR cs.MS/0307009 (2003) | |
| 2001 | ||
| j1 | Nicolas Brisebarre: Irrationality Measures of log 2 and π/√3. Experimental Mathematics 10(1): 35-52 (2001) | |
Data released under the ODC-BY 1.0 license — See also our legal information page