\input zb-basic \input zb-ioport \iteman{io-port 01683593} \itemau{Holt, Derek F.} \itemti{Computing automorphism groups of finite groups.} \itemso{Kantor, William M. (ed.) et al., Groups and computation III. Proceedings of the international conference at the Ohio State University, Columbus, OH, USA, June 15-19, 1999. Berlin: Walter de Gruyter. Ohio State Univ. Math. Res. Inst. Publ. 8, 201-208 (2001).} \itemab This paper gives an outline (a longer version is promised) of a new algorithm for computing the automorphism group of a finite group. Similar to the author's algorithm for subgroups [{\it J. J. Cannon, B. C. Cox, D. F. Holt}, J. Symb. Comput. 31, No. 1-2, 149-161 (2001; Zbl 0984.20002)] it uses tabulated information to obtain the automorphism group for the factor of the largest normal solvable subgroup, and then lifts the result via steps over elementary Abelian chief factors to the whole group. This lifting step generalizes the method for $p$-groups of {\it E. A. O'Brien} [Computational algebra and number theory, Math. Appl., Dordr. 325, 83-90 (1995; Zbl 0836.20002)] and the method for solvable groups of {\it M. J. Smith} [ Doctoral Thesis, Australian National University (1994)]. The main calculations concern the automorphism group of $KG$-modules, a potential bottleneck is to determine which group automorphisms induce particular module isomorphisms. The paper closes with a list of performance figures that show that the method proposed is certainly practical for groups of size $10^6$ (and likely larger groups as well). In fact with a few obvious exceptions (mainly $p$-groups) it succeeded on a list of all transitive groups of degree up to 30 determined by the reviewer [Konstruktion transitiver Permutationsgruppen, Aachener Beitr\"age zur Mathematik 18 (1996; Zbl 0955.20002)]. \itemrv{Alexander Hulpke (Fort Collins)} \itemcc{} \itemut{automorphism groups; computation; finite groups; algorithms; chief factors; transitive permutation groups} \itemli{} \end