1. Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, and Paul Zimmermann, MPFR: a multiple-precision binary floating-point library with correct rounding, ACM Trans. Math. Software 33 (2007), no. 2, Art. 13, 15.[MR]
  2. G. Hanrot and F. Morain, Solvability by radicals from an algorithmic point of view, in Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2001, pp. 175–182 (electronic).[MR]
  3. Guillaume Hanrot and Damien Stehlé, Improved analysis of Kannan's shortest lattice vector algorithm (extended abstract), Advances in cryptology—CRYPTO 2007, Lecture Notes in Comput. Sci., vol. 4622, Springer, Berlin, 2007, pp. 170–186.[MR]