default search action
Nicolas Brisebarre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Nicolas Brisebarre
, Jean-Michel Muller
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. 12(2): 656-666 (2024) - [j15]Florent Bréhard
Efficient and Validated Numerical Evaluation of Abelian Integrals. ACM Trans. Math. Softw. 50(1): 4:1-4:38 (2024) - [c19]Antoine Gonon, Nicolas Brisebarre, Elisa Riccietti, Rémi Gribonval:
A path-norm toolkit for modern networks: consequences, promises and challenges. ICLR 2024 - [i9]Antoine Gonon, Nicolas Brisebarre, Elisa Riccietti, Rémi Gribonval:
Path-metrics, pruning, and generalization. CoRR abs/2405.15006 (2024) - 2023
- [j14]Antoine Gonon
Approximation Speed of Quantized Versus Unquantized ReLU Neural Networks and Beyond. IEEE Trans. Inf. Theory 69(6): 3960-3977 (2023) - [c18]Nicolas Brisebarre, Jean-Michel Muller, Joris Picot:
Error in ulps of the multiplication or division by a correctly-rounded function or constant in binary floating-point arithmetic. ARITH 2023: 88 - [c17]Nicolas Brisebarre, Jean-Michel Muller, Joris Picot:
Testing the Sharpness of Known Error Bounds on the Fast Fourier Transform. ARITH 2023: 89-92 - [c16]Nicolas Brisebarre, Silviu-Ioan Filip:
Towards Machine-Efficient Rational L∞-Approximations of Mathematical Functions. ARITH 2023: 119-126 - [i8]Antoine Gonon, Nicolas Brisebarre, Elisa Riccietti, Rémi Gribonval:
A path-norm toolkit for modern networks: consequences, promises and challenges. CoRR abs/2310.01225 (2023) - 2022
- [i7]Antoine Gonon, Nicolas Brisebarre, Rémi Gribonval, Elisa Riccietti:
Approximation speed of quantized vs. unquantized ReLU neural networks and beyond. CoRR abs/2205.11874 (2022) - 2020
- [j13]Nicolas Brisebarre, Mioara Joldes, Jean-Michel Muller
Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform. ACM Trans. Math. Softw. 46(2): 11:1-11:27 (2020)
2010 – 2019
- 2018
- [j12]Florent Bréhard, Nicolas Brisebarre, Mioara Joldes:
Validated and Numerically Efficient Chebyshev Spectral Methods for Linear Ordinary Differential Equations. ACM Trans. Math. Softw. 44(4): 44:1-44:42 (2018) - [j11]Nicolas Brisebarre
A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters. IEEE Trans. Signal Process. 66(10): 2673-2684 (2018) - [c15]Nicolas Brisebarre, George A. Constantinides, Milos Ercezovac, Silviu-Ioan Filip
A High Throughput Polynomial and Rational Function Approximations Evaluator. ARITH 2018: 99-106 - 2017
- [b2]Nicolas Brisebarre:
Un peu de théorie des nombres et de calcul formel au service de l'arithmétique des ordinateurs. École normale supérieure de Lyon, France, 2017 - [j10]Nicolas Brisebarre
Exponential Sums and Correctly-Rounded Functions. IEEE Trans. Computers 66(12): 2044-2057 (2017) - 2016
- [j9]Nicolas Brisebarre, Christoph Quirin Lauter, Marc Mezzarobba, Jean-Michel Muller
Comparison between Binary and Decimal Floating-Point Numbers. IEEE Trans. Computers 65(7): 2032-2044 (2016) - 2014
- [j8]Dong Wang, Jean-Michel Muller
(M, p, k)-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function. IEEE Trans. Circuits Syst. II Express Briefs 61-II(9): 711-715 (2014) - 2013
- [c14]Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller
Comparison between Binary64 and Decimal64 Floating-Point Numbers. IEEE Symposium on Computer Arithmetic 2013: 145-152 - 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
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 Cryptol. ePrint Arch. 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
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
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
2000 – 2009
- 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
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
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
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 Cryptol. ePrint Arch. 2008: 115 (2008) - 2007
- [j5]Nicolas Brisebarre, Jean-Michel Muller
Correct rounding of algebraic functions. RAIRO Theor. Informatics Appl. 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
Arithmetic Operators for Pairing-Based Cryptography. CHES 2007: 239-255 - [c2]Jean-Luc Beuchat
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 Cryptol. ePrint Arch. 2007: 45 (2007) - [i3]Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto:
Arithmetic Operators for Pairing-Based Cryptography. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2007: 417 (2007) - 2006
- [j4]Nicolas Brisebarre, Jean-Michel Muller
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
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
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. Exp. Math. 10(1): 35-52 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: