Random lattices, threshold phenomena and efficient reduction algorithms, Theoretical Computer Science, vol.287, issue.2, pp.359-385, 2002. ,
DOI : 10.1016/S0304-3975(01)00251-1
URL : http://doi.org/10.1016/s0304-3975(01)00251-1
On the Reduction of a Random Basis, Proceedings of SIAM-ALENEX/ANALCO'07 ,
URL : https://hal.archives-ouvertes.fr/hal-00022848
Average Bit-Complexity of Euclidean Algorithms, Proceedings of ICALP'2000 -Genève, 14 pages, Lecture Notes in Computer Science 1853, pp.373-387 ,
DOI : 10.1007/3-540-45022-X_32
Dynamical analysis of ??-Euclidean algorithms, Journal of Algorithms, vol.44, issue.1, pp.246-285, 2002. ,
DOI : 10.1016/S0196-6774(02)00218-3
URL : https://hal.archives-ouvertes.fr/hal-00442421
Automorphic Forms and Representations, 1996. ,
DOI : 10.1017/CBO9780511609572
Erratum to ???Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes???, Algorithmica, vol.38, issue.4, pp.591-596, 2004. ,
DOI : 10.1007/s00453-003-1057-y
A course in Computational Algebraic Number Theory, GTM, vol.138, 2000. ,
DOI : 10.1007/978-3-662-02945-9
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction, Combinatorics, Probability and Computing, vol.6, issue.4, pp.397-433, 1997. ,
DOI : 10.1017/S0963548397003258
Gauss' reduction Algorithm : an average case analysis, Proceedings of IEEE-FOCS 90, pp.830-869 ,
URL : https://hal.archives-ouvertes.fr/inria-00075282
Continued fractions, Comparison algorithms and fine structure constants Constructive, Experimental et Non-Linear Analysis, Proceedings of Canadian Mathematical Society, pp.53-82, 2000. ,
Worst-case complexity bounds for algorithms in the theory of integral quadratic forms, Journal of Algorithms, vol.1, issue.2, pp.142-186, 1980. ,
DOI : 10.1016/0196-6774(80)90021-8
Distribution de la constante d'Hermite et du plus court vecteur dans les r??seaux de dimension deux, Journal de Th??orie des Nombres de Bordeaux, vol.6, issue.1, pp.135-159, 1994. ,
DOI : 10.5802/jtnb.110
Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.513-534, 1982. ,
DOI : 10.1007/BF01457454
Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research, vol.8, issue.4, pp.538-548, 1983. ,
DOI : 10.1287/moor.8.4.538
Computation of a class of Continued Fraction constants, Proceedings of Alenex- ANALCO'04, pp.199-210 ,
URL : https://hal.archives-ouvertes.fr/hal-00263891
Sharp Estimates for the Main Parameters of the Euclid Algorithm, Lecture Notes in Computer Science, vol.3887, pp.689-702, 2006. ,
DOI : 10.1007/11682462_63
URL : https://hal.archives-ouvertes.fr/hal-00210493
A Course in Arithmetic. Graduate Texts in Mathematics, 1973. ,
The Two Faces of Lattices in Cryptology, Proceedings of the 2001 Cryptography and Lattices Conference, pp.146-180, 2001. ,
Gauss' algorithm revisited, Journal of Algorithms, vol.12, issue.4, pp.556-572, 1991. ,
DOI : 10.1016/0196-6774(91)90033-U
Algorithms for computing signs of 2 × 2 determinants: dynamics and average?case analysis, Proceedings of ESA'97 (5th Annual European Symposium on Algorithms) (Graz, Septembre 97), pp.486-499 ,
Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes de Gauss et d'Euclide, Acta Arithmetica 81, pp.101-144, 1997. ,
Parallel lattice basis reduction, Papers from the international symposium on Symbolic and algebraic computation , ISSAC '92, 1992. ,
DOI : 10.1145/143242.143327
Fundamental Problems in Algorithmic Algebra, 1996. ,