1. S. I. Adian, Defining relations and algorithmic problems for groups and semigroups, Tr. Mat. Inst. Steklov 85 (Russian); Am. Math. Soc. (translation) 152, 1967.
2. S. I. Adian, Burnside problem and identities in groups, Moscow, Nauka, 332 p. (1975), translated by John Lennox and J. Wiegold, Ergebnisse der Math and ihrer Grenzgebiete, 95, Springer-Verlag, 1979.
3. S. I. Adian, G. S. Makanin, Studies in algorithmic questions of algebra, Algebra, Mat. Logic, Number theory, Topology, Proc. Steklov Institute of Mathematics, Vol. 168, (1984), English translation (1986), issue 3 of 4, 207–226.
4. M. D. Atkinson, Computational group theory, Academic Press, 1984.
5. J. Avenhaus and K. Madiener, The Nielsen reduction and P-complete problems in free groups, Theor. Comp. Science, 32(1984), 61–76.