Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 1N. Brunie.
  
  Contributions to computer arithmetic and applications to embedded systems, Ecole Normale Supérieure de Lyon, May 2014.
  
  https://tel.archives-ouvertes.fr/tel-01078204
• 2A. Langlois.
  
  Lattice-Based Cryptography: Security Foundations and Constructions, ENS Lyon, October 2014.
  
  https://hal.archives-ouvertes.fr/tel-01092130
• 3C. Pernet.
  
  High Performance and Reliable Algebraic Computing, Université Joseph Fourier, Grenoble 1, November 2014, Habilitation à diriger des recherches.
  
  https://tel.archives-ouvertes.fr/tel-01094212
• 4P. Théveny.
  
  Numerical Quality and High Performance in Interval Linear Algebra on Multi-Core Processors, ENS Lyon, October 2014.
  
  https://hal.inria.fr/tel-01107447

Articles in International Peer-Reviewed Journals

• 5M. Bardet, J.-C. Faugère, B. Salvy.
  
  On the complexity of the F5 Gröbner basis algorithm, in: Journal of Symbolic Computation, September 2014, pp. 1-24. [ DOI : 10.1016/j.jsc.2014.09.025 ]
  
  https://hal.inria.fr/hal-01064519
• 6A. Bostan, K. Raschel, B. Salvy.
  
  Non-D-finite excursions in the quarter plane, in: Journal of Combinatorial Theory, Series A, January 2014, vol. 121, pp. 45-63. [ DOI : 10.1016/j.jcta.2013.09.005 ]
  
  https://hal.archives-ouvertes.fr/hal-00697386
• 7S. Graillat, V. Lefèvre, J.-M. Muller.
  
  On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic, in: Numerical Algorithms, 2015, 15 p, forthcoming.
  
  https://hal-ens-lyon.archives-ouvertes.fr/ensl-00945033
• 8A. Langlois, D. Stehlé.
  
  Worst-case to average-case reductions for module lattices, in: Designs, Codes and Cryptography, 2014, 35 p.
  
  https://hal.archives-ouvertes.fr/hal-01091291
• 9C. Ling, L. Luzzi, J.-C. Belfiore, D. Stehlé.
  
  Semantically Secure Lattice Codes for the Gaussian Wiretap Channel, in: Information Theory, IEEE Transactions on, 2014, 18 p.
  
  https://hal.archives-ouvertes.fr/hal-01091295
• 10É. Martin-Dorel, G. Hanrot, M. Mayero, L. Théry.
  
  Formally verified certificate checkers for hardest-to-round computation, in: Journal of Automated Reasoning, 2015, vol. 54, n^o 1, pp. 1-29. [ DOI : 10.1007/s10817-014-9312-2 ]
  
  https://hal.inria.fr/hal-00919498
• 11J.-M. Muller.
  
  On the error of Computing ab + cd using Cornea, Harrison and Tang's method, in: ACM Transactions on Mathematical Software, January 2015, vol. 41, n^o 2, 8 p.
  
  https://hal-ens-lyon.archives-ouvertes.fr/ensl-00862910
• 12N. Revol, P. Théveny.
  
  Numerical Reproducibility and Parallel Computations: Issues for Interval Algorithms, in: IEEE Transactions on Computers, 2014, vol. 63, n^o 8, pp. 1915-1924, forthcoming. [ DOI : 10.1109/TC.2014.2322593 ]
  
  https://hal.inria.fr/hal-00916931
• 13S. M. Rump, C.-P. Jeannerod.
  
  Improved backward error bounds for LU and Cholesky factorizations, in: SIAM Journal on Matrix Analysis and Applications, 2014, vol. 35, n^o 2, pp. 684-698. [ DOI : 10.1137/130927231 ]
  
  https://hal.inria.fr/hal-00841361
• 14D. Wang, J.-M. Muller, N. Brisebarre, M. Ercegovac.
  
  (M, p, k)-Friendly Points: A Table-based Method to Evaluate Trigonometric Function, in: IEEE Transactions on Circuits and Systems. Part II, Express Briefs, September 2014, vol. 61, n^o 9, pp. 711-715. [ DOI : 10.1109/TCSII.2014.2331094 ]
  
  https://hal-ens-lyon.archives-ouvertes.fr/ensl-01001673

Articles in National Peer-Reviewed Journals

• 15F. Jézéquel, P. Langlois, N. Revol.
  
  First steps towards more numerical reproducibility, in: ESAIM: Proceedings, September 2014, vol. 45, pp. 229-238. [ DOI : 10.1051/proc/201445023 ]
  
  http://hal-lirmm.ccsd.cnrs.fr/lirmm-00872562

International Conferences with Proceedings

• 16B. Boyer, J.-G. Dumas, P. Giorgi, C. Pernet, B. D. Saunders.
  
  Elements of Design for Containers and Solutions in the LinBox Library, in: 4th International Congress on Mathematical Software, Seoul, South Korea, Springer, August 2014, vol. 8592, 8 pages.
  
  https://hal.archives-ouvertes.fr/hal-01015138
• 17J. Devigne, E. Guerrini, F. Laguillaumie.
  
  Proxy Re-Encryption Scheme Supporting a Selection of Delegatees, in: 7th International Conference on Cryptology AFRICACRYPT 2014, Marrakech, Morocco, LNCS, Springer, May 2014.
  
  https://hal.inria.fr/hal-00982549
• 18J.-G. Dumas, T. Gautier, C. Pernet, Z. Sultan.
  
  Parallel computation of echelon forms, in: EuroPar-2014, Porto, Portugal, August 2014, 12 p.
  
  https://hal.archives-ouvertes.fr/hal-00947013
• 19M. Joldes, J.-M. Muller, V. Popescu.
  
  On the computation of the reciprocal of floating point expansions using an adapted Newton-Raphson iteration, in: 25th IEEE International Conference on Application-specific Systems, Architectures and Processors, ASAP, Zurich, Switzerland, June 2014, 8 p, forthcoming.
  
  https://hal.archives-ouvertes.fr/hal-00957379
• 20E. L. Kaltofen, C. Pernet.
  
  Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance, in: ISSAC - 39th International Symposium on Symbolic and Algebraic Computation, Kobe, Japan, July 2014, In Proceedings of the International Symposium on Symbolic and Algebraic Computation 2014 (ISSAC'14). [ DOI : 10.1145/2608628.2608660 ]
  
  https://hal.inria.fr/hal-01068308
• 21A. Langlois, S. Ling, K. Nguyen, H. Wang.
  
  Lattice-based Group Signature Scheme with Verifier-local Revocation, in: Public-Key Cryptography - PKC2014, Buenos Aires, Argentina, H. Krawczyk (editor), Lecture Notes in Computer Science, Springer, March 2014, vol. 8383, pp. 345-361. [ DOI : 10.1007/978-3-642-54631-0 ]
  
  https://hal.archives-ouvertes.fr/hal-00983084
• 22A. Langlois, D. Stehlé, R. Steinfeld.
  
  GGHLite: More Efficient Multilinear Maps from Ideal Lattices, in: EUROCRYPT 2014, Copenhague, Denmark, May 2014.
  
  https://hal.archives-ouvertes.fr/hal-00983179
• 23R. Lashermes, M. Paindavoine, N. El Mrabet, J. Fournier, L. Goubin.
  
  Practical validation of several fault attacks against the Miller algorithm, in: FDTC - Workshop on Fault Diagnosis and Tolerance in Cryptography, Busan, South Korea, September 2014. [ DOI : 10.1109/FDTC.2014.21 ]
  
  https://hal.archives-ouvertes.fr/hal-01100813
• 24B. Libert, M. Joye, M. Yung.
  
  Born and Raised Distributively: Fully Distributed Non-Interactive Adaptively-Secure Threshold Signatures with Short Shares, in: ACM Symposium on Principles of Distributed Computing (PODC 2014), Paris, France, S. Dolev (editor), ACM, July 2014.
  
  https://hal.inria.fr/hal-00983149
• 25B. Libert, M. Joye, M. Yung, T. Peters.
  
  Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security, in: Asiacrypt 2014, Kaohsiung, Taiwan, Advances in Cryptology - Lecture Notes in Computer Science, Springer, December 2014, vol. 2, n^o 8874, pp. 1 - 21. [ DOI : 10.1007/978-3-662-45608-8_1 ]
  
  https://hal.inria.fr/hal-01088108
• 26B. Libert, T. Peters, M. Joye, M. Yung.
  
  Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures, in: Eurocrypt 2014, Copenhagen, Denmark, P. Nguyen, E. Oswald (editors), May 2014.
  
  https://hal.inria.fr/hal-00983147
• 27S. Ling, D. H. Phan, D. Stehlé, R. Steinfeld.
  
  Hardness of k-LWE and Applications in Traitor Tracing, in: CRYPTO, Santa Barbara, CA, United States, 2014.
  
  https://hal.archives-ouvertes.fr/hal-01091300
• 28N. Revol.
  
  Latest Developments on the IEEE 1788 Effort for the Standardization of Interval Arithmetic, in: ICVRAM & ISUMA - Second International Conference on Vulnerability and Risk Analysis and Management & Sixth International Symposium on Uncertainty Modelling and Analysis, Liverpool, United Kingdom, ASCE: American Society of Civil Engineers, July 2014, pp. 1-10, (Standardization effort supported by the Inria D2T.).
  
  https://hal.inria.fr/hal-00920662
• 29R. Serra, D. Arzelier, M. Joldes, J.-B. Lasserre, A. Rondepierre, B. Salvy.
  
  A New Method to Compute the Probability of Collision for Short-term Space Encounters, in: AIAA/AAS Astrodynamics Specialist Conference, San Diego, United States, August 2014. [ DOI : 10.2514/6.2014-4366 ]
  
  https://hal.inria.fr/hal-01092420
• 30D. Stehlé, G. Villard, I. Morel, G. Sarushi.
  
  LLL reducing with the most significant bits, in: ISSAC'14 - International symposium on Symbolic and algebraic computation, Kobe, Japan, ACM proceedings, July 2014. [ DOI : 10.1145/2608628.2608645 ]
  
  https://hal-ens-lyon.archives-ouvertes.fr/ensl-00993445

Scientific Books (or Scientific Book chapters)

• 31F. De Dinechin, J.-M. Muller.
  
  Evaluating Elementary Functions, in: Princeton Companion to Applied Mathematics, N. Higham (editor), Princeton University Press, 2014, 2 p.
  
  https://hal.inria.fr/ensl-00989001
• 32A. Gil, J.-M. Muller, J. Segura.
  
  Edition d'un numéro spécial "Numerical Software: Design, Analysis and Verification", Elsevier, September 2014, vol. 90 part A, 1 p.
  
  https://hal-ens-lyon.archives-ouvertes.fr/ensl-01070771
• 33F. Laguillaumie, A. Langlois, D. Stehlé.
  
  Chiffrement avancé à partir du problème Learning With Errors, in: Informatique Mathématique : une photographie en 2014, S. Peyronnet (editor), Presses universitaires de Perpignan, March 2014.
  
  https://hal.inria.fr/hal-00984055

Internal Reports

• 34C.-P. Jeannerod, S. M. Rump.
  
  On relative errors of floating-point operations: optimal bounds and applications, January 2014, 15 p.
  
  https://hal.inria.fr/hal-00934443
• 35M. Joldes, O. Marty, J.-M. Muller, V. Popescu.
  
  Arithmetic algorithms for extended precision using floating-point expansions, LIP - ENS Lyon ; LAAS-CNRS ; ENS Cachan, January 2015, Rapport LAAS n° 15016.
  
  https://hal.archives-ouvertes.fr/hal-01111551

Scientific Popularization

• 36J.-M. Muller, S. Boldo.
  
  Des ordinateurs capables de calculer plus juste, in: La Recherche, October 2014, pp. 46-53.
  
  https://hal-ens-lyon.archives-ouvertes.fr/ensl-01069744

Other Publications

• 37N. Brisebarre, C. Lauter, M. Mezzarobba, J.-M. Muller.
  
  Comparison between binary and decimal floating-point numbers, July 2014.
  
  https://hal.archives-ouvertes.fr/hal-01021928
• 38M. F. I. Chowdhury, C.-P. Jeannerod, V. Neiger, E. Schost, G. Villard.
  
  Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations, February 2014.
  
  https://hal.inria.fr/hal-00941435
• 39J.-G. Dumas, T. Gautier, C. Pernet, J.-L. Roch, Z. Sultan.
  
  Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination, November 2014.
  
  https://hal.archives-ouvertes.fr/hal-01084238
• 40J.-G. Dumas, C. Pernet, Z. Sultan.
  
  Computing the Rank Profile Matrix *, January 2015.
  
  https://hal.archives-ouvertes.fr/hal-01107722
• 41C.-P. Jeannerod.
  
  A rounding error analysis of the Cornea-Harrison-Tang method in radix $\beta$, July 2014, Preprint submitted on April 5, 2014 and revised on July 15, 2014.
  
  https://hal.inria.fr/hal-01050021
• 42C.-P. Jeannerod, P. Kornerup, N. Louvet, J.-M. Muller.
  
  Error bounds on complex floating-point multiplication with an FMA, July 2014.
  
  https://hal.inria.fr/hal-00867040