Nicolas Brisebarre

According to our database, Nicolas Brisebarre authored at least 40 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Efficient and Validated Numerical Evaluation of Abelian Integrals.

Florent Bréhard, Nicolas Brisebarre, Mioara Joldes, Warwick Tucker

ACM Trans. Math. Softw., March, 2024

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, June, 2023

A path-norm toolkit for modern networks: consequences, promises and challenges.

Antoine Gonon, Nicolas Brisebarre, Elisa Riccietti, Rémi Gribonval

CoRR, 2023

Testing the Sharpness of Known Error Bounds on the Fast Fourier Transform.

Nicolas Brisebarre, Jean-Michel Muller, Joris Picot

Proceedings of the 30th IEEE Symposium on Computer Arithmetic, 2023

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

Proceedings of the 30th IEEE Symposium on Computer Arithmetic, 2023

Towards Machine-Efficient Rational L^∞-Approximations of Mathematical Functions.

Nicolas Brisebarre, Silviu-Ioan Filip

Proceedings of the 30th IEEE Symposium on Computer Arithmetic, 2023

2022

Approximation speed of quantized vs. unquantized ReLU neural networks and beyond.

Antoine Gonon, Nicolas Brisebarre, Rémi Gribonval, Elisa Riccietti

CoRR, 2022

2020

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

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

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 High Throughput Polynomial and Rational Function Approximations Evaluator.

Nicolas Brisebarre, George A. Constantinides, Milos Ercezovac, Silviu-Ioan Filip, Matei Istoan, Jean-Michel Muller

Proceedings of the 25th IEEE Symposium on Computer Arithmetic, 2018

2017

Exponential Sums and Correctly-Rounded Functions.

Nicolas Brisebarre, Guillaume Hanrot, Olivier Robert

IEEE Trans. Computers, 2017

Un peu de théorie des nombres et de calcul formel au service de l'arithmétique des ordinateurs.

Nicolas Brisebarre

, 2017

2016

Comparison between Binary and Decimal Floating-Point Numbers.

Nicolas Brisebarre, Christoph Quirin Lauter, Marc Mezzarobba, Jean-Michel Muller

IEEE Trans. Computers, 2016

2014

(M, p, k)-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function.

Dong Wang, Jean-Michel Muller, Nicolas Brisebarre, Milos D. Ercegovac

IEEE Trans. Circuits Syst. II Express Briefs, 2014

2013

Comparison between Binary64 and Decimal64 Floating-Point Numbers.

Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller, Christoph Quirin Lauter

Proceedings of the 21st IEEE Symposium on Computer Arithmetic, 2013

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

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

Proceedings of the NASA Formal Methods, 2012

(M, p, k)-Friendly Points: A Table-Based Method for Trigonometric Function Evaluation.

Nicolas Brisebarre, Milos D. Ercegovac, Jean-Michel Muller

Proceedings of the 23rd IEEE International Conference on Application-Specific Systems, 2012

2011

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

Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

2010

Chebyshev interpolation polynomial-based tools for rigorous computing.

Nicolas Brisebarre, Mioara Joldes

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 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

Proceedings of the 21st IEEE International Conference on Application-specific Systems Architectures and Processors, 2010

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, ISBN: 978-0-8176-4704-9, 2010

2008

Correctly Rounded Multiplication by Arbitrary Precision Constants.

Nicolas Brisebarre, Jean-Michel Muller

IEEE Trans. Computers, 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

A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F_2^m and F_3^m.

Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez

IACR Cryptol. ePrint Arch., 2008

Integer and floating-point constant multipliers for FPGAs.

Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller

Proceedings of the 19th IEEE International Conference on Application-Specific Systems, 2008

An efficient method for evaluating polynomial and rational function approximations.

Nicolas Brisebarre, Sylvain Chevillard, Milos D. Ercegovac, Jean-Michel Muller, Serge Torres

Proceedings of the 19th IEEE International Conference on Application-Specific Systems, 2008

2007

Correct rounding of algebraic functions.

Nicolas Brisebarre, Jean-Michel Muller

RAIRO Theor. Informatics Appl., 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

IACR Cryptol. ePrint Arch., 2007

Algorithms and Arithmetic Operators for Computing the eta_T Pairing in Characteristic Three.

Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, Tsuyoshi Takagi

IACR Cryptol. ePrint Arch., 2007

Arithmetic Operators for Pairing-Based Cryptography.

Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto

IACR Cryptol. ePrint Arch., 2007

A Coprocessor for the Final Exponentiation of the <i>eta</i> _<i>T</i> Pairing in Characteristic Three.

Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto

Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

Floating-point L²-approximations to functions.

Nicolas Brisebarre, Guillaume Hanrot

Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

Efficient polynomial L-approximations.

Nicolas Brisebarre, Sylvain Chevillard

Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

2006

Computing machine-efficient polynomial approximations.

Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand

ACM Trans. Math. Softw., 2006

2005

A New Range-Reduction Algorithm.

Nicolas Brisebarre, David Defour, Peter Kornerup, Jean-Michel Muller, Nathalie Revol

IEEE Trans. Computers, 2005

2004

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

2003

Finding the "truncated" polynomial that is closest to a function

Nicolas Brisebarre, Jean-Michel Muller

CoRR, 2003

2001

Irrationality Measures of log 2 and π/√3.

Nicolas Brisebarre

Exp. Math., 2001