1. M. Ajtai, The shortest vector problem in L2 is NP-hard for randomized reduction. Proc. 30th Annual ACM Symp. on Theory of Computing, STOC-98, 1998, pp. 10–19.
2. A. Akhavi, Analyse comparative d'algorithmes de réduction sur les réseaux aléatoires, Ph.D. Thesis, Université de Caen, 1999 (http://www.info.unicaen.fr/ ̃akhavi/these.ps.gz).
3. A. Akhavi, Threshold phenomena in random lattices and efficient reduction algorithms, Proc. ESA’99, Prague, Lecture Notes in Computer Science, vol. 1643, Springer, New York, 1999, pp. 476–490.
4. Advanced Mathematical Methods for Scientists and Engineers;Bender,1978
5. N. Bleistein, R.A. Handelsman, Asymptotic Expansions of Integrals, Dover, New York, 1975 (reprinted 1986).