Members
Overall Objectives
Research Program
Application Domains
Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Publications of the year

Articles in International Peer-Reviewed Journals

[1]
M. Bardet, J.-C. Faugère, B. Salvy, P.-J. Spaenlehauer.
On the Complexity of Solving Quadratic Boolean Systems, in: Journal of Complexity, February 2013, vol. 29, no 1, pp. 53-75. [ DOI : 10.1016/j.jco.2012.07.001 ]
http://hal.inria.fr/hal-00655745
[2]
A. Bostan, K. Raschel, B. Salvy.
Non-D-finite excursions in the quarter plane, in: Journal of Combinatorial Theory, Series A, October 2013, vol. 121, pp. 45-63. [ DOI : 10.1016/j.jcta.2013.09.005 ]
http://hal.inria.fr/hal-00697386
[3]
F. De Dinechin, P. Echeverria, M. Lopez-Vallejo, B. Pasca.
Floating-Point Exponentiation Units for Reconfigurable Computing, in: ACM Transactions on Reconfigurable Technology and Systems, May 2013, vol. 6, no 1, 4:1 p, To appear. [ DOI : 10.1145/2457443.2457447 ]
http://hal.inria.fr/ensl-00718637
[4]
F. De Dinechin, C. Lauter, J.-M. Muller, S. Torres.
On Ziv's rounding test, in: ACM Transactions on Mathematical Software, 2013, vol. 39, no 4, 26 p.
http://hal.inria.fr/ensl-00693317
[5]
C.-P. Jeannerod, N. Louvet, J.-M. Muller.
Further analysis of Kahan's algorithm for the accurate computation of 2 x 2 determinants, in: Mathematics of Computation, 2013, vol. 82, no 284, pp. 2245-2264. [ DOI : 10.1090/S0025-5718-2013-02679-8 ]
http://hal.inria.fr/ensl-00649347
[6]
C.-P. Jeannerod, C. Pernet, A. Storjohann.
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition, in: Journal of Symbolic Computation, 2013, vol. 56, pp. 46-68. [ DOI : 10.1016/j.jsc.2013.04.004 ]
http://hal.inria.fr/hal-00841300
[7]
C.-P. Jeannerod, S. M. Rump.
Improved error bounds for inner products in floating-point arithmetic, in: SIAM Journal on Matrix Analysis and Applications, April 2013, vol. 34, no 2, pp. 338-344. [ DOI : 10.1137/120894488 ]
http://hal.inria.fr/hal-00840926
[8]
C. Ling, L. Luzzi, D. Stehlé.
Decoding by Embedding: Correct Decoding Radius and DMT Optimality, in: IEEE Transactions on Information Theory, 2013, vol. 59, no 5, pp. 2960-2973. [ DOI : 10.1109/TIT.2012.2236144 ]
http://hal.inria.fr/hal-00922195
[9]
É. Martin-Dorel, G. Melquiond, J.-M. Muller.
Some issues related to double roundings, in: BIT Numerical Mathematics, December 2013, vol. 53, no 4, pp. 897-924. [ DOI : 10.1007/s10543-013-0436-2 ]
http://hal.inria.fr/ensl-00644408
[10]
N. Revol, P. Théveny.
Parallel Implementation of Interval Matrix Multiplication, in: Reliable Computing, 2013, vol. 19, no 1, pp. 91-106.
http://hal.inria.fr/hal-00801890

Articles in National Peer-Reviewed Journals

[11]
N. Brunie, S. Collange.
Reconvergence de contrôle implicite pour les architectures SIMT, in: Technique et Science Informatiques (TSI), February 2013, vol. 32, no 2, pp. 153-178. [ DOI : 10.3166/TSI.32.153-178 ]
http://hal.inria.fr/hal-00787749

Articles in Non Peer-Reviewed Journals

[12]
F. Langrognet, F. Jézéquel, N. Revol.
JDEV 2013 : Développer pour Calculer : Des outils pour calculer avec précision & Comment calculer avec des intervalles, in: HPC magazine, November 2013.
http://hal.inria.fr/hal-00921492

Invited Conferences

[13]
J.-M. Muller.
Avoiding double roundings in scaled Newton-Raphson division, in: Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, United States, 2013, 4 p.
http://hal.inria.fr/ensl-00875366

International Conferences with Proceedings

[14]
R. Bhattacharyya, A. Roy.
Secure Message Authentication against Related Key Attack, in: Fast Software Encryption, Singapore, 2013, pp. 245-262.
http://hal.inria.fr/hal-00920172
[15]
A. Bostan, P. Lairez, B. Salvy.
Creative telescoping for rational functions using the Griffiths-Dwork method, in: ISSAC'13 - 38th International Symposium on Symbolic and Algebraic Computation, Boston, United States, Northeastern University, Boston, Massachusetts, USA, 2013, pp. 93-100. [ DOI : 10.1145/2465506.2465935 ]
http://hal.inria.fr/hal-00777675
[16]
Z. Brakerski, A. Langlois, C. Peikert, O. Regev, D. Stehlé.
Classical Hardness of Learning with Errors, in: Proceedings of STOC, United States, 2013, pp. 575-584.
http://hal.inria.fr/hal-00922194
[17]
N. Brisebarre, M. Mezzarobba, J.-M. Muller, C. Lauter.
Comparison between binary64 and decimal64 floating-point numbers, in: 21st IEEE Symposium on Computer Arithmetic, Austin, TX, United States, A. Nannarelli, P.-M. Seidel, P. T. P. Tang (editors), IEEE Computer Society, April 2013, 8 p. [ DOI : 10.1109/ARITH.2013.23 ]
http://hal.inria.fr/ensl-00737881
[18]
N. Brunie, F. De Dinechin, M. Istoan, G. Sergent, K. Illyes, B. Popa.
Arithmetic core generation using bit heaps, in: 23rd International Conference on Field Programmable Logic and Applications, Porto, Portugal, September 2013.
http://hal.inria.fr/ensl-00738412
[19]
J. Chen, D. Stehlé, G. Villard.
A New View on HJLS and PSLQ: Sums and Projections of Lattices, in: Proceedings of ISSAC, United States, 2013, pp. 149-156.
http://hal.inria.fr/hal-00922192
[20]
S. Chevillard, M. Mezzarobba.
Multiple precision evaluation of the Airy Ai function with reduced cancellation, in: 21st IEEE Symposium on Computer Arithmetic, Austin, TX, United States, A. Nannarelli, P.-M. Seidel, P. T. P. Tang (editors), 2013, pp. 175-182. [ DOI : 10.1109/ARITH.2013.33 ]
http://hal.inria.fr/hal-00767085
[21]
F. De Dinechin, M. Istoan, G. Sergent.
Fixed-Point Trigonometric Functions on FPGAs, in: Fourth International Symposium on Highly-Efficient Accelerators and Reconfigurable Technologies, Edimburgh, United Kingdom, June 2013.
http://hal.inria.fr/ensl-00802777
[22]
C.-P. Jeannerod, N. Louvet, J.-M. Muller.
On the componentwise accuracy of complex floating-point division with an FMA, in: 21st IEEE Symposium on Computer Arithmetic, Austin, TX, United States, IEEE Computer Society, April 2013, 8 p.
http://hal.inria.fr/ensl-00734339
[23]
F. Johansson, M. Kauers, M. Mezzarobba.
Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation, in: ISSAC - 28th International Symposium on Symbolic and Algebraic Computation, Boston, Massachusetts, United States, 2013.
http://hal.inria.fr/hal-00818789
[24]
F. Laguillaumie, A. Langlois, B. Libert, D. Stehlé.
Lattice-Based Group Signatures with Logarithmic Signature Size, in: ASIACRYPT 2013 - 19th International Conference on the Theory and Application of Cryptology and Information Security, Bangaluru, India, K. Sako, P. Sarkar (editors), LNCS, 2013, vol. 8270. [ DOI : 10.1007/978-3-642-42045-0_3 ]
http://hal.inria.fr/hal-00920420
[25]
V. Lefèvre.
SIPE: Small Integer Plus Exponent, in: 21th IEEE Symposium on Computer Arithmetic - Arith'21, Austin, Texas, United States, 2013.
http://hal.inria.fr/hal-00763954
[26]
S. Ling, K. Nguyen, D. Stehlé, H. Wang.
Improved Zero-knowledge Proofs of Knowledge for the ISIS Problem, and Applications, in: Proceedings of PKC 2013, Japan, 2013, pp. 107–124.
http://hal.inria.fr/hal-00767548

National Conferences with Proceedings

[27]
N. Brunie, F. De Dinechin, B. De Dinechin.
Conception d'une matrice reconfigurable pour coprocesseur fortement couplé, in: Symposium en Architectures nouvelles de machines, France, January 2013.
http://hal.inria.fr/ensl-00763067
[28]
N. Brunie, F. De Dinechin, M. Istoan, G. Sergent.
L'arithmétique sur le tas, in: Symposium en Architectures nouvelles de machines, France, January 2013.
http://hal.inria.fr/ensl-00762990
[29]
F. Jézéquel, P. Langlois, N. Revol.
First steps towards more numerical reproducibility, in: SMAI'2013 : 6ème biennale des Mathématiques Appliquées et Industrielles, Seignosse, France, ESAIM: Proceedings, October 2013, pp. 001-010.
http://hal.inria.fr/lirmm-00872562

Conferences without Proceedings

[30]
N. Revol, P. Théveny.
Numerical reproducibility in HPC: issues in interval arithmetic, in: SWIM'2013: Small Workshop on Interval Methods, Brest, France, L. Jaulin, N. Ramdani (editors), June 2013.
http://hal.inria.fr/hal-00922114
[31]
N. Revol, P. Théveny.
Numerical reproducibility in HPC: the interval point of view, in: PPAM'2013: 10th International Conference on Parallel Processing and Applied Mathematics, Warsaw, Poland, September 2013.
http://hal.inria.fr/hal-00922117

Scientific Books (or Scientific Book chapters)

[32]
F. De Dinechin, B. Pasca.
Reconfigurable arithmetic for HPC, in: High-Performance Computing using FPGAs, W. Vanderbauwhede, K. Benkrid (editors), Springer, March 2013.
http://hal.inria.fr/ensl-00758377

Internal Reports

[33]
R. Bhattacharyya.
Non-Adaptive Programmability of Random Oracles, December 2013, Submitted.
http://hal.inria.fr/hal-00920173
[34]
R. Bhattacharyya, S. Chakraborty.
Constant Query Locally Decodable Codes against Computationally Bounded Adversary, December 2013, Submitted.
http://hal.inria.fr/hal-00920174

Other Publications

[35]
M. Bardet, J.-C. Faugère, B. Salvy.
On the Complexity of the F5 Gröbner basis Algorithm, December 2013, 20 p.
http://hal.inria.fr/hal-00915522
[36]
C.-P. Jeannerod, P. Kornerup, N. Louvet, J.-M. Muller.
Error bounds on complex floating-point multiplication with an FMA, December 2013.
http://hal.inria.fr/hal-00867040
[37]
C.-P. Jeannerod, S. M. Rump.
On relative errors of floating-point operations: optimal bounds and applications, January 2014.
http://hal.inria.fr/hal-00934443
[38]
O. Kupriianova, C. Lauter, J.-M. Muller.
Radix Conversion for IEEE754-2008 Mixed Radix Floating-Point Arithmetic, 2013.
http://hal.inria.fr/ensl-00916532
[39]
V. Lefèvre.
Sipe: a Mini-Library for Very Low Precision Computations with Correct Rounding, September 2013.
http://hal.inria.fr/hal-00864580
[40]
É. Martin-Dorel, G. Hanrot, M. Mayero, L. Théry.
Formally verified certificate checkers for hardest-to-round computation, December 2013.
http://hal.inria.fr/hal-00919498
[41]
J.-M. Muller.
On the error of Computing ab + cd using Cornea, Harrison and Tang's method, 2013, Submitted to ACM TOMS.
http://hal.inria.fr/ensl-00862910
[42]
N. Revol.
Latest Developments on the IEEE 1788 Effort for the Standardization of Interval Arithmetic, 2013, standardization effort supported by the Inria D2T – submitted to ASCE-ICVRAM 2014 conference.
http://hal.inria.fr/hal-00920662
[43]
N. Revol, P. Théveny.
Numerical Reproducibility and Parallel Computations: Issues for Interval Algorithms, 2013, submitted to IEEE Transactions on Computers.
http://hal.inria.fr/hal-00916931
[44]
N. Revol, P. Théveny.
Numerical Reproducibility and Parallel Computations: Issues for Interval Algorithms, July 2013.
http://hal.inria.fr/hal-00845839
[45]
S. M. Rump, C.-P. Jeannerod.
Improved backward error bounds for LU and Cholesky factorizations, July 2013.
http://hal.inria.fr/hal-00841361