Irrationality Measures of log 2 and π/√3. - Nicolas Brisebarre (Exp. Math., 2001)

Finding the "truncated" polynomial that is closest to a function - Nicolas Brisebarre; Jean-Michel Muller (CoRR, 2003)

Accelerating Correctly Rounded Floating-Point Division when the Divisor Is Known in Advance. - Nicolas Brisebarre; Jean-Michel Muller; Saurabh Kumar Raina (IEEE Trans. Computers, 2004)

A New Range-Reduction Algorithm. - Nicolas Brisebarre; David Defour; Peter Kornerup; Jean-Michel Muller; Nathalie Revol (IEEE Trans. Computers, 2005)

Computing machine-efficient polynomial approximations. - Nicolas Brisebarre; Jean-Michel Muller; Arnaud Tisserand (ACM Trans. Math. Softw., 2006)

Efficient polynomial L-approximations. - Nicolas Brisebarre; Sylvain Chevillard (IEEE Symposium on Computer Arithmetic, 2007)

Floating-point L2-approximations to functions. - Nicolas Brisebarre; Guillaume Hanrot (IEEE Symposium on Computer Arithmetic, 2007)

A Coprocessor for the Final Exponentiation of the eta T Pairing in Characteristic Three. - Jean-Luc Beuchat; Nicolas Brisebarre; Masaaki Shirase; Tsuyoshi Takagi; Eiji Okamoto (WAIFI, 2007)

Arithmetic Operators for Pairing-Based Cryptography. - Jean-Luc Beuchat; Nicolas Brisebarre; Jérémie Detrey; Eiji Okamoto (IACR Cryptol. ePrint Arch., 2007)

Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three. - Jean-Luc Beuchat; Nicolas Brisebarre; Jérémie Detrey; Eiji Okamoto; Masaaki Shirase; Tsuyoshi Takagi (IACR Cryptol. ePrint Arch., 2007)

A Coprocessor for the Final Exponentiation of the etaT Pairing in Characteristic Three. - Jean-Luc Beuchat; Nicolas Brisebarre; Masaaki Shirase; Tsuyoshi Takagi; Eiji Okamoto (IACR Cryptol. ePrint Arch., 2007)

Correct rounding of algebraic functions. - Nicolas Brisebarre; Jean-Michel Muller (RAIRO Theor. Informatics Appl., 2007)

An efficient method for evaluating polynomial and rational function approximations. - Nicolas Brisebarre; Sylvain Chevillard; Milos D. Ercegovac; Jean-Michel Muller; Serge Torres (ASAP, 2008)

Integer and floating-point constant multipliers for FPGAs. - Nicolas Brisebarre; Florent de Dinechin; Jean-Michel Muller (ASAP, 2008)

A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F2m and F3m. - Jean-Luc Beuchat; Nicolas Brisebarre; Jérémie Detrey; Eiji Okamoto; Francisco Rodríguez-Henríquez (IACR Cryptol. ePrint Arch., 2008)

Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three. - Jean-Luc Beuchat; Nicolas Brisebarre; Jérémie Detrey; Eiji Okamoto; Masaaki Shirase; Tsuyoshi Takagi (IEEE Trans. Computers, 2008)

Correctly Rounded Multiplication by Arbitrary Precision Constants. - Nicolas Brisebarre; Jean-Michel Muller (IEEE Trans. Computers, 2008)

Handbook of Floating-Point Arithmetic. - Jean-Michel Muller; Nicolas Brisebarre; Florent de Dinechin; Claude-Pierre Jeannerod; Vincent Lefèvre; Guillaume Melquiond; Nathalie Revol; Damien Stehlé; Serge Torres (Birkhäuser, 2010)

Implementing decimal floating-point arithmetic through binary: Some suggestions. - Nicolas Brisebarre; Nicolas Louvet; Érik Martin-Dorel; Jean-Michel Muller; Adrien Panhaleux; Milos D. Ercegovac (ASAP, 2010)

Chebyshev interpolation polynomial-based tools for rigorous computing. - Nicolas Brisebarre; Mioara Joldes (ISSAC, 2010)

Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2). - Nicolas Brisebarre; Mioara Joldes; Peter Kornerup; Érik Martin-Dorel; Jean-Michel Muller (IEEE Symposium on Computer Arithmetic, 2011)

(M, p, k)-Friendly Points: A Table-Based Method for Trigonometric Function Evaluation. - Nicolas Brisebarre; Milos D. Ercegovac; Jean-Michel Muller (ASAP, 2012)

Rigorous Polynomial Approximation Using Taylor Models in Coq. - Nicolas Brisebarre; Mioara Joldes; Érik Martin-Dorel; Micaela Mayero; Jean-Michel Muller; Ioana Pasca; Laurence Rideau; Laurent Théry (NASA Formal Methods, 2012)

High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions. - Tamas Györfi; Octavian Cret; Guillaume Hanrot; Nicolas Brisebarre (IACR Cryptol. ePrint Arch., 2012)

Comparison between Binary64 and Decimal64 Floating-Point Numbers. - Nicolas Brisebarre; Marc Mezzarobba; Jean-Michel Muller; Christoph Quirin Lauter (IEEE Symposium on Computer Arithmetic, 2013)

(M, p, k)-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function. - Dong Wang 040; Jean-Michel Muller; Nicolas Brisebarre; Milos D. Ercegovac (IEEE Trans. Circuits Syst. II Express Briefs, 2014)

Comparison between Binary and Decimal Floating-Point Numbers. - Nicolas Brisebarre; Christoph Quirin Lauter; Marc Mezzarobba; Jean-Michel Muller (IEEE Trans. Computers, 2016)

Un peu de théorie des nombres et de calcul formel au service de l'arithmétique des ordinateurs. - Nicolas Brisebarre (2017)

Exponential Sums and Correctly-Rounded Functions. - Nicolas Brisebarre; Guillaume Hanrot; Olivier Robert (IEEE Trans. Computers, 2017)

A High Throughput Polynomial and Rational Function Approximations Evaluator. - Nicolas Brisebarre; George A. Constantinides; Milos Ercezovac; Silviu-Ioan Filip; Matei Istoan; Jean-Michel Muller (ARITH, 2018)

Validated and Numerically Efficient Chebyshev Spectral Methods for Linear Ordinary Differential Equations. - Florent Bréhard; Nicolas Brisebarre; Mioara Joldes (ACM Trans. Math. Softw., 2018)

A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters. - Nicolas Brisebarre; Silviu-Ioan Filip; Guillaume Hanrot (IEEE Trans. Signal Process., 2018)

Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform. - Nicolas Brisebarre; Mioara Joldes; Jean-Michel Muller; Ana-Maria Nanes; Joris Picot (ACM Trans. Math. Softw., 2020)

Approximation speed of quantized vs. unquantized ReLU neural networks and beyond. - Antoine Gonon; Nicolas Brisebarre; Rémi Gribonval; Elisa Riccietti (CoRR, 2022)

Towards Machine-Efficient Rational L∞-Approximations of Mathematical Functions. - Nicolas Brisebarre; Silviu-Ioan Filip (ARITH, 2023)

Testing the Sharpness of Known Error Bounds on the Fast Fourier Transform. - Nicolas Brisebarre; Jean-Michel Muller; Joris Picot (ARITH, 2023)

Approximation Speed of Quantized Versus Unquantized ReLU Neural Networks and Beyond. - Antoine Gonon; Nicolas Brisebarre; Rémi Gribonval; Elisa Riccietti (IEEE Trans. Inf. Theory, 2023)

A path-norm toolkit for modern networks: consequences, promises and challenges. - Antoine Gonon; Nicolas Brisebarre; Elisa Riccietti; Rémi Gribonval (ICLR, 2024)

Path-metrics, pruning, and generalization. - Antoine Gonon; Nicolas Brisebarre; Elisa Riccietti; Rémi Gribonval (CoRR, 2024)

Error in Ulps of the Multiplication or Division by a Correctly-Rounded Function or Constant in Binary Floating-Point Arithmetic. - Nicolas Brisebarre; Jean-Michel Muller; Joris Picot (IEEE Trans. Emerg. Top. Comput., 2024)

Efficient and Validated Numerical Evaluation of Abelian Integrals. - Florent Bréhard; Nicolas Brisebarre; Mioara Joldes; Warwick Tucker (ACM Trans. Math. Softw., 2024)