Team Arénaire
Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography
previous up next PDF XML

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, no 2, p. 236–256.
[2]
F. de Dinechin, A. Tisserand.
Multipartite table methods, in: IEEE Transactions on Computers, 2005, vol. 54, no 3, p. 319-330.
[3]
G. Hanrot, D. Stehlé.
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm (Extended Abstract), in: Proceedings of Crypto 2007, LNCS, Springer, 2007, vol. 4622, p. 170–186.
[4]
C.-P. Jeannerod, G. Villard.
Essentially optimal computation of the inverse of generic polynomial matrices, in: Journal of Complexity, 2005, vol. 21, no 1, p. 72–86.
[5]
E. Kaltofen, G. Villard.
On the complexity of computing determinants, in: Computational Complexity, 2004, vol. 13, p. 91–130.
[6]
J.-M. Muller.
Elementary Functions, Algorithms and Implementation, Birkhäuser Boston, 2nd Edition, 2006.
[7]
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

Doctoral Dissertations and Habilitation Theses

[8]
C. Lauter.
Arrondi correct de fonctions mathématiques - fonctions univariées et bivariées, certification et automatisation, Thèse de doctorat, École Normale Supérieure de Lyon, October 2008.
[9]
R. Michard.
Opérateurs arithmétiques matériels optimisés, Ph. D. Thesis, Ecole normale supérieure de lyon - ENS LYON, 06 2008
http://tel.archives-ouvertes.fr/tel-00301285/en/.

Articles in International Peer-Reviewed Journal

[10]
J.-L. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto, M. Shirase, T. Takagi.
Algorithms and Arithmetic Operators for Computing the $ \eta$T Pairing in Characteristic Three, in: IEEE Transactions on Computers, November 2008, vol. 57, no 11, p. 1454-1468.
[11]
J.-L. Beuchat, T. Miyoshi, J.-M. Muller, E. Okamoto.
Horner's Rule-Based Multiplication over GF(p) and GF( pn ): A Survey, in: International Journal of Electronics, 2008, vol. 95, no 7, p. 669–685.
[12]
J.-L. Beuchat, J.-M. Muller.
Automatic Generation of Modular Multipliers for FPGA Applications, in: IEEE Transactions on Computers, December 2008, vol. 57, no 12.
[13]
S. Boldo, G. Melquiond.
Emulation of a FMA and Correctly Rounded Sums: Proved Algorithms Using Rounding to Odd, in: IEEE Transactions on Computers, April 2008, vol. 57, no 4, p. 462–471
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4358278.
[14]
A. Bostan, C.-P. Jeannerod, É. Schost.
Solving structured linear systems with large displacement rank, in: Theoretical Computer Science, November 2008, vol. 407, no 1:3, p. 155–181.
[15]
N. Brisebarre, J.-M. Muller.
Correctly rounded multiplication by arbitrary precision constants, in: IEEE Transactions on Computers, February 2008, vol. 57, no 2, p. 165–174.
[16]
O. Creţ, I. Trestian, R. Tudoran, L. Darabant, L. Vǎcariu, F. de Dinechin.
Accelerating The Computation of The Physical Parameters Involved in Transcranial Magnetic Stimulation Using FPGA Devices., in: Romanian Journal of Information, Science and Technology, 2008, vol. 10, no 4, p. 361-379.
[17]
M. Ercegovac, J.-M. Muller.
An Efficient Method for Evaluating Complex Polynomials, in: Journal of VLSI Signal Processing Systems, to appear, 2009.
[18]
S. Graillat, Ph. Langlois, N. Louvet.
Algorithms for Accurate, Validated and Fast Polynomial Evaluation, in: Japan Journal of Industrial and Applied Mathematics, to appear, 2009.
[19]
P. Kornerup, C. Lauter, V. Lefèvre, N. Louvet, J.-M. Muller.
Computing Correctly Rounded Integer Powers in Floating-Point Arithmetic, in: ACM Transactions on Mathematical Software, to appear, 2009.
[20]
C. Lauter, V. Lefèvre.
An efficient rounding boundary test for pow(x,y) in double precision, in: IEEE Transactions on Computers, to appear, February 2009, vol. 58, no 2, p. 197–207
http://doi.ieeecomputersociety.org/10.1109/TC.2008.202.
[21]
P. Q. Nguyen, D. Stehlé.
Low-dimensional lattice basis reduction revisited, in: ACM Transactions on Algorithms, 2008
http://hal.inria.fr/inria-00328629/en/.

Articles in National Peer-Reviewed Journal

[22]
J. Detrey, F. de Dinechin.
Fonctions élémentaires en virgule flottante pour les accélérateurs reconfigurables, in: Technique et Science Informatiques, 2008, vol. 27, no 6, p. 673–698.
[23]
R. Michard, A. Tisserand, N. Veyrat-Charvillon.
Optimisation d'opérateurs arithmétiques matériels à base d'approximations polynomiales, in: Technique et science informatiques, June 2008, vol. 27, no 6, p. 699–718
http://tsi.revuesonline.com/article.jsp?articleId=12222.
[24]
I. Morel, D. Stehlé, G. Villard.
Analyse numérique et réduction des réseaux, in: Technique et Science Informatiques, to appear, 2009.

International Peer-Reviewed Conference/Proceedings

[25]
A. Akhavi, D. Stehlé.
Speeding-up Lattice Reduction With Random Projections, in: Proc. 8th Latin American Theoretical Informatics (LATIN'08), Lecture Notes in Computer Science, Springer, 2008, vol. 4957, p. 293–305.
[26]
J.-C. Bajard, P. Langlois, D. Michelucci, G. Morin, N. Revol.
Towards Guaranteed Geometric Computations with Approximate Arithmetics, in: Advanced Signal Processing Algorithms, Architectures, and Implementations XVIII, part of the SPIE Optics & Photonics 2008 Symposium, August 2008, vol. 7074, 12 pages p.
[27]
J.-L. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto, F. Rodríguez-Henríquez.
A Comparison between Hardware Accelerators for the Modified Tate Pairing over Im5 $\#120125 _2^m$ and Im1 $\#120125 _3^m$ , in: Second International Conference on Pairing-based Cryptography (Pairing'08), Springer Verlag, 2008, vol. 5209, p. 297–315.
[28]
N. Brisebarre, S. Chevillard, M. Ercegovac, J.-M. Muller, S. Torres.
An efficient Method for Evaluating Polynomial and Rational Function Approximations, in: Application-specific Systems, Architectures and Processors, IEEE, 2008, p. 245–250.
[29]
N. Brisebarre, F. de Dinechin, J.-M. Muller.
Integer and Floating-Point Constant Multipliers for FPGAs, in: Application-specific Systems, Architectures and Processors, IEEE, 2008, p. 239–244.
[30]
S. Chevillard, N. Revol.
Computation of the error function erf in arbitrary precision with correct rounding, in: RNC 8 Proceedings, 8th Conference on Real Numbers and Computers, Javier D. Bruguera and Marc Daumas, July 2008, p. 27–36.
[31]
O. Creţ, F. de Dinechin, I. Trestian, R. Tudoran, L. Creţ, L. Vǎcariu.
FPGA-based Acceleration of the Computations Involved in Transcranial Magnetic Stimulation, in: Southern Programmable Logic Conference, IEEE, 2008, p. 43-48.
[32]
F. de Dinechin, B. Pasca, O. Creţ, R. Tudoran.
An FPGA-specific Approach to Floating-Point Accumulation and Sum-of-Products, in: Field-Programmable Technologies, IEEE, 2008, p. 33–40.
[33]
R. Baker. Kearfott, John D. Pryce, N. Revol.
Discussions on an Interval Arithmetic Standard at Dagstuhl Seminar 08021, in: Dagstuhl Seminar on Numerical Validation in Current Hardware Architectures, Lecture Notes in Computer Science, to appear, Annie Cuyt and Walter Krämer and Wolfram Luther and Peter Markstein, 2008.
[34]
Ph. Langlois, N. Louvet.
Compensated Horner algorithm in K times the working precision, in: RNC 8 Proceedings, 8th Conference on Real Numbers and Computers, Javier D. Bruguera and Marc Daumas, July 2008, p. 157–166.
[35]
C. Lauter, F. de Dinechin.
Optimising polynomials for floating-point implementation, in: RNC 8 Proceedings, 8th Conference on Real Numbers and Computers, J. D. Bruguera, M. Daumas (editors), Javier D. Bruguera and Marc Daumas, July 2008, p. 7–16.
[36]
V. Lefèvre, D. Stehlé, P. Zimmermann.
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format, in: Reliable Implementation of Real Number Algorithms: Theory and Practice, Dagstuhl, Germany, Lecture Notes in Computer Science, Springer, 2008, vol. 5045, p. 114–126
http://hal.inria.fr/inria-00068731/en/.
[37]
X. Pujol, D. Stehlé.
Rigorous and Efficient Short Lattice Vectors Enumeration, in: Proceedings of ASIACRYPT'08, Lecture Notes in Computer Science, Springer, 2008, vol. 5350, p. 390-405.
[38]
I. Trestian, O. Creţ, L. Creţ, L. Vǎcariu, R. Tudoran, F. de Dinechin.
Computing the Inductance of Coils Used for Transcranial Magnetic Stimulation With FPGA Devices, in: Biomedical Engineering (BioMED), IASTED, 2008, p. 327-333.
[39]
I. Trestian, O. Creţ, L. Creţ, L. Vǎcariu, R. Tudoran, F. de Dinechin.
FPGA-based Computation of the Inductance of Coils Used for the Magnetic Stimulation of the Nervous System, in: Biomedical Electronics and Devices, 2008, vol. 1, p. 151-155.
[40]
G. Villard.
Differentiation of Kaltofen's division-free determinant algorithm, in: MICA'2008 : Milestones in Computer Algebra, Stonehaven Bay, Trinidad and Tobago, May 2008.

National Peer-Reviewed Conference/Proceedings

[41]
N. Brisebarre, F. de Dinechin, J.-M. Muller.
Multiplieurs et diviseurs constants en virgule flottante avec arrondi correct, in: RenPar'18, SympA'2008, CFSE'6, 2008.

Workshops without Proceedings

[42]
C.-P. Jeannerod, N. Louvet, N. Revol, G. Villard.
Computing Condition Numbers with Automatic Differentiation, in: SCAN 2008 - 13th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, El Paso, Texas, 2008.
[43]
C.-P. Jeannerod, N. Louvet, N. Revol, G. Villard.
On the Computation of some Componentwise Condition Numbers, in: SNSC'08 - 4th International Conference on Symbolic and Numerical Scientific Computing, Hagenberg, Austria, 2008.
[44]
P. Langlois, N. Louvet.
Accurate solution of triangular linear system, in: SCAN 2008 - 13th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, El Paso, Texas, 2008.
[45]
N. Revol, H.-D. Nguyen.
Solving and Certifying the Solution of a Linear System, in: SCAN 2008 - 13th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, El Paso, Texas, 2008.
[46]
N. Revol.
Automatic Adaptation of the Computing Precision, in: V Taylor Models Workshop, May 2008.
[47]
N. Revol.
Introduction to Interval Analysis and to some Interval-Based Software Systems and Libraries, in: ECMI 2008, The European Consortium For Mathematics In Industry, July 2008.
[48]
N. Revol.
Survey of Proposals for the Standardization of Interval Arithmetic, in: SWIM 08: Small Workshop on Interval Methods, June 2008.

Scientific Books (or Scientific Book chapters)

[49]
F. de Dinechin, M. Ercegovac, J.-M. Muller, N. Revol.
Digital Arithmetic, in: Encyclopedia of Computer Science and Engineering, Wiley, 2008.
[50]
D. Stehlé.
Floating-point LLL: theoretical and practical aspects, in: LLL+25: 25th Anniversary of the LLL Algorithm Conference, to appear, Springer, 2008.

Books or Proceedings Editing

[51]
P. Hertling, C. M. Hoffmann, W. Luther, N. Revol (editors)
Special issue on Reliable Implementation of Real Number Algorithms: Theory and Practice, Lecture Notes in Computer Science, 2008, vol. 5045.

Internal Reports

[52]
S. Chevillard, M. Joldes, C. Lauter.
Certified and fast computation of supremum norms of approximation errors, Technical report, École Normale Supérieure de Lyon, 2008, no ensl-00334545
http://prunel.ccsd.cnrs.fr/ensl-00334545.
[53]
F. de Dinechin, C. Klein, B. Pasca.
Generating high-performance arithmetic operators for FPGAs, Technical report, École Normale Supérieure de Lyon, 2008, no ensl-00321209
http://prunel.ccsd.cnrs.fr/ensl-00321209/.
[54]
G. Hanrot, D. Stehlé.
Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases, Technical report, Maths Arxiv, 2008
http://arxiv.org/abs/0801.3331.
[55]
C.-P. Jeannerod, H. Knochel, C. Monat, G. Revy.
Computing floating-point square roots via bivariate polynomial evaluation, Technical report, École Normale Supérieure de Lyon, 2008, no ensl-00335792
http://prunel.ccsd.cnrs.fr/ensl-00335792.
[56]
C.-P. Jeannerod, H. Knochel, C. Monat, G. Revy, G. Villard.
A new binary floating-point division algorithm and its software implementation on the ST231 processor, Technical report, École Normale Supérieure de Lyon, 2008, no ensl-00335892
http://prunel.ccsd.cnrs.fr/ensl-00335892.
[57]
J.-M. Muller, P. Kornerup, V. Lefèvre, N. Louvet.
On the computation of correctly-rounded sums, Technical report, École Normale Supérieure de Lyon, 2008, no ensl-00331519
http://prunel.ccsd.cnrs.fr/ensl-00331519/.
[58]
G. Villard.
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, Technical report, École Normale Supérieure de Lyon, 2008, no ensl-00335918
http://prunel.ccsd.cnrs.fr/ensl-00335918.

Other Publications

[59]
I. Morel.
From an LLL-reduced basis to another, poster for the ISSAC'08 conference, 2008.

previous
next