V. Arvind and J. Torán, Solvable group isomorphism, Proceedings of the 19th IEEE Conference on Computational Complexity, pp.91-103, 2004.
DOI : 10.1145/1944857.1944859
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.9136

L. Babai, Trading group theory for randomness, Proceedings of the seventeenth annual ACM symposium on Theory of computing , STOC '85, pp.421-429, 1985.
DOI : 10.1145/22145.22192
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.3397

L. Babai, Local expansion of vertex-transitive graphs and random generation in finite groups, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.164-174, 1991.
DOI : 10.1145/103418.103440

L. Babai and E. Szemerédi, On The Complexity Of Matrix Group Problems I, 25th Annual Symposium onFoundations of Computer Science, 1984., pp.229-240, 1984.
DOI : 10.1109/SFCS.1984.715919

J. Buchmann and A. Schmidt, Computing the structure of a finite abelian group, Mathematics of Computation, vol.74, issue.252, pp.2017-2026, 2005.
DOI : 10.1090/S0025-5718-05-01740-0

T. J. Chou and G. E. Collins, Algorithms for the Solution of Systems of Linear Diophantine Equations, SIAM Journal on Computing, vol.11, issue.4, pp.687-708, 1982.
DOI : 10.1137/0211057

M. H. Garzon and Y. Zalcstein, On isomorphism testing of a class of 2-Nilpotent groups, Journal of Computer and System Sciences, vol.42, issue.2, pp.237-248, 1991.
DOI : 10.1016/0022-0000(91)90012-T

G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1979.
DOI : 10.1090/S0002-9904-1929-04793-1

D. F. Holt, B. Eick, and E. A. O-'brien, Handbook of computational group theory, 2005.

R. Kannan and A. Bachem, Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix, SIAM Journal on Computing, vol.8, issue.4, pp.499-507, 1979.
DOI : 10.1137/0208040

T. Kavitha, Linear time algorithms for Abelian group isomorphism and related problems, Journal of Computer and System Sciences, vol.73, issue.6, pp.986-996, 2007.
DOI : 10.1016/j.jcss.2007.03.013
URL : http://doi.org/10.1016/j.jcss.2007.03.013

J. Köbler, J. Torán, and U. Schöning, The graph isomorphism problem: its structural complexity, Birkhäuser, 1993.
DOI : 10.1007/978-1-4612-0333-9

R. J. Lipton, L. Snyder, and Y. Zalcstein, The complexity of word and isomorphism problems for finite groups, 1976.

G. Miller, On the n log n isomorphism technique, Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp.51-58, 1978.

E. A. O-'brien, Isomorphism testing for p-groups, Journal of Symbolic Computation, vol.17, issue.2, pp.133-147, 1994.
DOI : 10.1006/jsco.1994.1007

J. Pomfret, Similarity of matrices over finite rings, Proceedings of the American Mathematical Society, vol.37, issue.2, pp.421-422, 1973.
DOI : 10.1090/S0002-9939-1973-0309963-X

A. Ranum, The group of classes of congruent matrices with application to the group of isomorphisms. Transactions of the, pp.71-91, 1907.

S. Shanks, Class number, a theory of factorization and generata, Proceedings of Symposia in Pure Mathematics, pp.419-440, 1969.

V. Shoup, A computational introduction to number theory and algebra, 2005.

M. Smith, Computing automorphisms of finite soluble groups, Bulletin of the Australian Mathematical Society, vol.71, issue.01, 1994.
DOI : 10.1016/S0747-7171(08)80078-8

A. K. Steel, A New Algorithm for the Computation of Canonical Forms of Matrices over Fields, Journal of Symbolic Computation, vol.24, issue.3-4, pp.409-432, 1997.
DOI : 10.1006/jsco.1996.0142

N. Vikas, AnO(n) Algorithm for Abelianp-Group Isomorphism and anO(nlogn) Algorithm for Abelian Group Isomorphism, Journal of Computer and System Sciences, vol.53, issue.1, pp.1-9, 1996.
DOI : 10.1006/jcss.1996.0045
URL : http://doi.org/10.1006/jcss.1996.0045