There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field.
The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.
Prof. William M. Kantor, Department of Mathematics, University of Oregon, USA.
Prof. Ákos Seress, Department of Mathematics, The Ohio State University, Columbus, USA.