Bibliography

Major publications by the team in recent years

[1]

N. Brisebarre, J.-M. Muller, A. Tisserand.
Computing machine-efficient polynomial approximations, in: ACM Transactions on Mathematical Software, June 2006, vol. 32, n^o 2, p. 236–256.

[2]

F. de Dinechin, A. Tisserand.
Multipartite table methods, in: IEEE Transactions on Computers, 2005, vol. 54, n^o 3, p. 319-330.

[3]

C.-P. Jeannerod, G. Villard.
Essentially optimal computation of the inverse of generic polynomial matrices, in: Journal of Complexity, 2005, vol. 21, n^o 1, p. 72–86.

[4]

E. Kaltofen, G. Villard.
On the complexity of computing determinants, in: Computational Complexity, 2004, vol. 13, p. 91–130.

[5]

J.-M. Muller.
Elementary Functions, Algorithms and Implementation, Birkhäuser Boston, 2nd Edition, 2006.

[6]

N. Revol, K. Makino, M. Berz.
Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY, in: Journal of Logic and Algebraic Programming, 2005, vol. 64, p. 135–154.

Publications of the year

Books and Monographs

[7]

P. Kornerup, J.-M. Muller (editors)
Proceedings of the 18th IEEE Symposium on Computer Arithmetic, IEEE Conference Publishing Services, June 2007.

Doctoral dissertations and Habilitation theses

[8]

F. J. Cháves Alonso.
Utilisation et certification de l'arithmétique d'intervalles dans un assistant de preuves, Ph. D. Thesis, École Normale Supérieure de Lyon, Lyon, France, September 2007
http://www.ens-lyon.fr/LIP/Pub/Rapports/PhD/PhD2007/PhD2007-05.pdf.

[9]

F. de Dinechin.
Matériel et logiciel pour l'évaluation de fonctions numériques. Précision, performance et validation, Habilitation à diriger des recherches, Université Claude Bernard - Lyon 1, June 2007
http://www.ens-lyon.fr/LIP/Pub/Rapports/HDR/HDR2007/HDR2007-01.pdf.

[10]

J. Detrey.
Arithmétiques réelles sur FPGA : virgule fixe, virgule flottante et système logarithmique, Ph. D. Thesis, École Normale Supérieure de Lyon, Lyon, France, January 2007
http://www.ens-lyon.fr/LIP/Pub/Rapports/PhD/PhD2007/PhD2007-01.pdf.

[11]

N. Veyrat-Charvillon.
Opérateurs arithmétiques matériels pour des applications spécifiques, Ph. D. Thesis, École Normale Supérieure de Lyon, Lyon, France, June 2007
http://www.ens-lyon.fr/LIP/Pub/Rapports/PhD/PhD2007/PhD2007-04.pdf.

Articles in refereed journals and book chapters

[12]

N. Brisebarre, J.-M. Muller.
Correct Rounding of Algebraic Functions, in: Theoretical Informatics and Applications, jan-mars 2007, vol. 41, p. 71–83.

[13]

F. de Dinechin, C. Q. Lauter, J.-M. Muller.
Fast and correctly rounded logarithms in double-precision, in: Theoretical Informatics and Applications, 2007, vol. 41, p. 85-102.

[14]

J. Detrey, F. de Dinechin.
A tool for unbiased comparison between logarithmic and floating-point arithmetic, in: Journal of VLSI Signal Processing, 2007, vol. 49, n^o 1, p. 161–175
http://dx.doi.org/10.1007/s11265-007-0048-7.

[15]

J. Detrey, F. de Dinechin.
Parameterized floating-point logarithm and exponential functions for FPGAs, in: Microprocessors and Microsystems, Special Issue on FPGA-based Reconfigurable Computing, December 2007, vol. 31, n^o 8, p. 537–545
http://dx.doi.org/10.1016/j.micpro.2006.02.008.

[16]

M. Ercegovac, J.-M. Muller.
Complex Square Root with Operand Prescaling, in: Journal of VLSI Signal Processing, October 2007, vol. 49, n^o 1, p. 19–30.

[17]

L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier, P. Zimmermann.
MPFR: A multiple-precision binary floating-point library with correct rounding, in: ACM Trans. Math. Softw., 2007, vol. 33, n^o 2
http://portal.acm.org/citation.cfm?doid=1236463.1236468.

[18]

R. Glabb, L. Imbert, G. Jullien, A. Tisserand, N. Veyrat-Charvillon.
Multi-mode Operator for SHA-2 Hash Functions, in: Journal of Systems Architecture, Special issue on "Embedded Cryptographic Hardware", 2007, vol. 53, n^o 2-3, p. 127–138
http://dx.doi.org/10.1016/j.sysarc.2006.09.006.

[19]

G. Melquiond, S. Pion.
Formally certified floating-point filters for homogeneous geometric predicates, in: Theoretical Informatics and Applications, 2007, vol. 41, n^o 1.

Publications in Conferences and Workshops

[20]

J.-L. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto.
Arithmetic Operators for Pairing-Based Cryptography, in: Cryptographic Hardware and Embedded Systems – CHES 2007, P. Paillier, I. Verbauwhede (editors), Lecture Notes in Computer Science, best paper award, Springer, 2007, n^o 4727, p. 239–255.

[21]

J.-L. Beuchat, N. Brisebarre, M. Shirase, T. Takagi, E. Okamoto.
A Coprocessor for the Final Exponentiation of the η T Pairing in Characteristic Three, in: Proceedings of Waifi 2007, C. Carlet, B. Sunar (editors), Lecture Notes in Computer Science, Springer, 2007, n^o 4547, p. 25–39.

[22]

A. Bostan, C.-P. Jeannerod, É. Schost.
Solving Toeplitz- and Vandermonde-like linear systems with large displacement rank, in: Proc. International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, ACM Press, August 2007, p. 33–40.

[23]

N. Brisebarre, S. Chevillard.
Efficient polynomial L ∞ -approximations, in: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH'18), IEEE Computer Society, 2007, p. 169–176.

[24]

N. Brisebarre, G. Hanrot.
Floating-point L 2 approximations to functions, in: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH'18), IEEE Computer Society, 2007, p. 177–184.

[25]

F. J. Cháves Alonso, M. Daumas, C. Muñoz, N. Revol.
Automatic strategies to evaluate formulas on Taylor models and generate proofs in PVS, in: 6th International Congress on Industrial and Applied Mathematics (ICIAM'07), July 2007.

[26]

S. Chevillard, C. Lauter.
A certified infinite norm for the implementation of elementary functions, in: Seventh International Conference on Quality Software (QSIC 2007), A. Mathur, W. E. Wong, M. F. Lau (editors), IEEE, 2007, p. 153–160.

[27]

J. Detrey, F. de Dinechin.
Floating-point trigonometric functions for FPGAs, in: Intl Conference on Field-Programmable Logic and Applications, IEEE, August 2007, p. 29-34.

[28]

J. Detrey, F. de Dinechin, X. Pujol.
Return of the hardware floating-point elementary function, in: 18th Symposium on Computer Arithmetic, IEEE, June 2007, p. 161–168.

[29]

W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, G. Villard.
Faster inversion and other black box matrix computation using efficient block projections, in: Proc. International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, ACM Press, August 2007, p. 143–150.

[30]

M. Ercegovac, J.-M. Muller.
A Hardware-Oriented Method for Evaluating ComplexPolynomials, in: Proceedings of 18th IEEE Conference on Application-Specific Systems, Architectures and Processors (ASAP'2007), IEEE Conference Publishing Services, July 2007.

[31]

M. Ercegovac, J.-M. Muller.
Complex Multiply-Add and Other Related Operators, in: Proceedings of SPIE Conf. Advanced Signal Processing Algorithms, Architectures and Implementation XVII, August 2007.

[32]

G. Hanrot, V. Lefèvre, D. Stehlé, P. Zimmermann.
Worst Cases of a Periodic Function for Large Arguments, in: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH'18), IEEE computer society, 2007, p. 133–140
http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=4272859.

[33]

G. Hanrot, D. Stehlé.
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm (Extended Abstract), in: Proceedings of Crypto 2007, LNCS, Springer-Verlag, 2007, vol. 4622, p. 170–186.

[34]

C.-P. Jeannerod, H. Knochel, C. Monat, G. Revy.
Faster floating-point square root for integer processors, in: IEEE Symposium on Industrial Embedded Systems (SIES'07), 2007.

[35]

P. Kornerup, V. Lefèvre, J.-M. Muller.
Computing Integer Powers in Floating-Point Arithmetic, in: Proceedings of 41th Conference on signals, systems and computers, IEEE Conference Publishing Services, November 2007.

[36]

N. Revol.
Implementing Taylor models arithmetic with floating-point arithmetic, in: 6th International Congress on Industrial and Applied Mathematics (ICIAM'07), July 2007.

[37]

G. Villard.
Certification of the QR Factor R, and of Lattice Basis Reducedness, in: Proc. International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, ACM Press, August 2007, p. 361–368.

[38]

G. Villard.
Some recent progress in symbolic linear algebra and related questions (invited tutorial), in: Proc. International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, ACM Press, August 2007, p. 391–392.

Internal Reports

[39]

F. de Dinechin, J. Detrey, I. Trestian, O. Creţ, R. Tudoran.
When FPGAs are better at floating-point than microprocessors, Technical report, École Normale Supérieure de Lyon, 2007, n^o ensl-00174627
http://prunel.ccsd.cnrs.fr/ensl-00174627.

[40]

F. de Dinechin, C. Q. Lauter, G. Melquiond.
Certifying floating-point implementations using Gappa, Technical report, École Normale Supérieure de Lyon, 2007, n^o ensl-00200830, arXiv:0801.0523
http://prunel.ccsd.cnrs.fr/ensl-00200830/.

[41]

C. Lauter, V. Lefèvre.
An efficient rounding boundary test for pow(x,y) in double precision, Technical report, Laboratoire de l'Informatique du Parallélisme , Lyon, France, August 2007, n^o RR2007-36
http://prunel.ccsd.cnrs.fr/ensl-00169409.

[42]

G. Villard.
Certification of the QR Factor R, and of Lattice Basis Reducedness (extended version), Technical report, HAL, 2007, n^o hal-00127059
http://hal.archives-ouvertes.fr/hal-00127059/en.

Miscellaneous

[43]

J.-L. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto, M. Shirase, T. Takagi.
Algorithms and Arithmetic Operators for Computing the η T Pairing in Characteristic Three, Cryptology ePrint Archive, Report 2007/417, 2007.

[44]

A. Bostan, C.-P. Jeannerod, É. Schost.
Solving structured linear systems with large displacement rank, submitted to Theoretical Computer Science, 2007.

[45]

G. Hanrot, D. Stehlé.
Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases, draft, 2007.

[46]

C.-P. Jeannerod, H. Knochel, C. Monat, G. Revy.
High-ILP emulation of IEEE floating-point square roots on integer VLIW processors, draft, 2007.

[47]

D. Stehlé, G. Villard.
Perturbation analysis for the QR factorization of LLL reduced matrices, Gecko meeting, Sophia Antipolis, France, Nov. 2007, draft, 2007.

References in notes

[48]

W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, G. Villard.
Solving sparse integer linear systems, in: Proc. International Symposium on Symbolic and Algebraic Computation, Genova, Italy, ACM Press, July 2006, p. 63–70.