Nicolas Brisebarre

Orcid: 0000-0002-4220-2132

According to our database1, Nicolas Brisebarre authored at least 41 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient and Validated Numerical Evaluation of Abelian Integrals.
ACM Trans. Math. Softw., March, 2024

Error in Ulps of the Multiplication or Division by a Correctly-Rounded Function or Constant in Binary Floating-Point Arithmetic.
IEEE Trans. Emerg. Top. Comput., 2024

Path-metrics, pruning, and generalization.
CoRR, 2024

A path-norm toolkit for modern networks: consequences, promises and challenges.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Approximation Speed of Quantized Versus Unquantized ReLU Neural Networks and Beyond.
IEEE Trans. Inf. Theory, June, 2023

Testing the Sharpness of Known Error Bounds on the Fast Fourier Transform.
Proceedings of the 30th IEEE Symposium on Computer Arithmetic, 2023

Towards Machine-Efficient Rational L<sup>∞</sup>-Approximations of Mathematical Functions.
Proceedings of the 30th IEEE Symposium on Computer Arithmetic, 2023

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

2020
Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform.
ACM Trans. Math. Softw., 2020

2018
A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters.
IEEE Trans. Signal Process., 2018

Validated and Numerically Efficient Chebyshev Spectral Methods for Linear Ordinary Differential Equations.
ACM Trans. Math. Softw., 2018

A High Throughput Polynomial and Rational Function Approximations Evaluator.
Proceedings of the 25th IEEE Symposium on Computer Arithmetic, 2018

2017
Exponential Sums and Correctly-Rounded Functions.
IEEE Trans. Computers, 2017

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

2016
Comparison between Binary and Decimal Floating-Point Numbers.
IEEE Trans. Computers, 2016

2014
(M, p, k)-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function.
IEEE Trans. Circuits Syst. II Express Briefs, 2014

2013
Comparison between Binary64 and Decimal64 Floating-Point Numbers.
Proceedings of the 21st IEEE Symposium on Computer Arithmetic, 2013

2012
High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions.
IACR Cryptol. ePrint Arch., 2012

Rigorous Polynomial Approximation Using Taylor Models in Coq.
Proceedings of the NASA Formal Methods, 2012

(M, p, k)-Friendly Points: A Table-Based Method for Trigonometric Function Evaluation.
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).
Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

2010
Chebyshev interpolation polynomial-based tools for rigorous computing.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Implementing decimal floating-point arithmetic through binary: Some suggestions.
Proceedings of the 21st IEEE International Conference on Application-specific Systems Architectures and Processors, 2010


2008
Correctly Rounded Multiplication by Arbitrary Precision Constants.
IEEE Trans. Computers, 2008

Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three.
IEEE Trans. Computers, 2008

A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F<sub>2<sup>m</sup></sub> and F<sub>3<sup>m</sup></sub>.
IACR Cryptol. ePrint Arch., 2008

Integer and floating-point constant multipliers for FPGAs.
Proceedings of the 19th IEEE International Conference on Application-Specific Systems, 2008

An efficient method for evaluating polynomial and rational function approximations.
Proceedings of the 19th IEEE International Conference on Application-Specific Systems, 2008

2007
Correct rounding of algebraic functions.
RAIRO Theor. Informatics Appl., 2007

A Coprocessor for the Final Exponentiation of the eta<sub>T</sub> Pairing in Characteristic Three.
IACR Cryptol. ePrint Arch., 2007

Algorithms and Arithmetic Operators for Computing the eta<sub>T</sub> Pairing in Characteristic Three.
IACR Cryptol. ePrint Arch., 2007

Arithmetic Operators for Pairing-Based Cryptography.
IACR Cryptol. ePrint Arch., 2007

A Coprocessor for the Final Exponentiation of the <i>eta</i> <sub> <i>T</i> </sub> Pairing in Characteristic Three.
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

Floating-point L<sup>2</sup>-approximations to functions.
Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

Efficient polynomial L-approximations.
Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

2006
Computing machine-efficient polynomial approximations.
ACM Trans. Math. Softw., 2006

2005
A New Range-Reduction Algorithm.
IEEE Trans. Computers, 2005

2004
Accelerating Correctly Rounded Floating-Point Division when the Divisor Is Known in Advance.
IEEE Trans. Computers, 2004

2003
Finding the "truncated" polynomial that is closest to a function
CoRR, 2003

2001
Irrationality Measures of log 2 and π/√3.
Exp. Math., 2001


  Loading...