| 2012 | ||
|---|---|---|
| i5 | Tamas Györfi, Octavian Cret, Guillaume Hanrot, Nicolas Brisebarre: High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions. IACR Cryptology ePrint Archive 2012: 343 (2012) | |
| 2011 | ||
| c9 | Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Algorithms for the Shortest and Closest Lattice Vector Problems. IWCC 2011: 159-190 | |
| c8 | Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. CRYPTO 2011: 447-464 | |
| i4 | Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Terminating BKZ. IACR Cryptology ePrint Archive 2011: 198 (2011) | |
| 2010 | ||
| j7 | Guillaume Hanrot, Bruno Martin, Gerald Tenenbaum: Constantes de Turán-Kubilius friables: une étude numérique. Experimental Mathematics 19(3): 345-361 (2010) | |
| c7 | Jérémie Detrey, Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Accelerating Lattice Reduction with FPGAs. LATINCRYPT 2010: 124-143 | |
| e1 | Guillaume Hanrot, François Morain, Emmanuel Thomé (Eds.): Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings. Lecture Notes in Computer Science 6197, Springer 2010, isbn 978-3-642-14517-9 | |
| 2008 | ||
| i3 | Guillaume Hanrot, Damien Stehlé: Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases. CoRR abs/0801.3331 (2008) | |
| 2007 | ||
| j6 | Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann: MPFR: A multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33(2): 13 (2007) | |
| c6 | Guillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann: Worst Cases of a Periodic Function for Large Arguments. IEEE Symposium on Computer Arithmetic 2007: 133-140 | |
| c5 | Nicolas Brisebarre, Guillaume Hanrot: Floating-point L2-approximations to functions. IEEE Symposium on Computer Arithmetic 2007: 177-186 | |
| c4 | Guillaume Hanrot, Damien Stehlé: Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CRYPTO 2007: 170-186 | |
| c3 | Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima: Time-and space-efficient evaluation of some hypergeometric constants. ISSAC 2007: 85-91 | |
| c2 | ||
| i2 | Guillaume Hanrot, Damien Stehlé: Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CoRR abs/0705.0965 (2007) | |
| i1 | Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann: Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. CoRR abs/cs/0701151 (2007) | |
| 2004 | ||
| j5 | Guillaume Hanrot, Michel Quercia, Paul Zimmermann: The Middle Product Algorithm I. Appl. Algebra Eng. Commun. Comput. 14(6): 415-438 (2004) | |
| j4 | Guillaume Hanrot, Paul Zimmermann: A long note on Mulders' short product. J. Symb. Comput. 37(3): 391-401 (2004) | |
| j3 | David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, Paul Zimmermann: Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. Numerical Algorithms 37(1-4): 367-375 (2004) | |
| 2003 | ||
| j2 | Guillaume Hanrot, Joël Rivat, Gerald Tenenbaum, Paul Zimmermann: Density results on floating-point invertible numbers. Theor. Comput. Sci. 291(2): 135-141 (2003) | |
| 2001 | ||
| c1 | Guillaume Hanrot, François Morain: Solvability by radicals from an algorithmic point of view. ISSAC 2001: 175-182 | |
| 2000 | ||
| j1 | Guillaume Hanrot: Solving Thue equations without the full unit group. Math. Comput. 69(229): 395-405 (2000) | |
Data released under the ODC-BY 1.0 license — See also our legal information page