Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1   BOSMA, \V., AND CANNON, J. Structural computation in finite permutation groups. CWI Quarterly 5, 2 (1992), 127.--160.

2   BOSMA. W~., AND CANNON, J. Handbook of MAGMA functions. School of Mathematics and Statistics, University of Sydney, 1996.

3   BUTLEn, G. Computational Approaches to Certain Problems Zn the Theory of Fimte Groups. PAD thesis, University of Sydney, Sydney, 1979.

4   Greg Butler, An inductive schema for computing conjugacy classes in permutation groups

5   BUTLER, G. Computing the conjugacy classes of elements of a finite group. In Groups '93 Galway/St Andrews, Vol. i, Galway 1993 (Cambridge, 1995), C. M. Campbell, T. C. Hurley, E. F. Robertson, S. J. "robin, and J. J. Ward, Eds., vol. 211 of LMS Lecture Notes Series, Cambridge University Press, pp. 80-112.

6   CAMERON, P. J. Finite permutation groups and finite simple groups. Bull. London. Math. Soc. 13 (1981), 1-22.

7   John J. Cannon , Derek F. Holt, Computing chief series, composition series and socles in large permutation groups

8   CONWAY, Z. H., CURTIS, R. T., NORTON, S, P., PARKER, R. A.. AND v~VILSON, R. A. Atlas of finite groups. Clarendon Press, Oxford, 1985.

9   DIXON, J. D., AND MORTIMER, B. Permutation groups. Springer, New York, 1996.

10   EASDOWN, D., AND PRAEGEn, C. E. Minimal faithful permutation representations. Bull. Austral. Math. Soc. 38 (1988), 207-.-220.

11   FELSCH, V., AND NEUBi)SER, J. An algorithm for the computation of conjugacy classes and centralizers in p-groups. In Symbolic and algebraic computation, EUROSAM '79, Marseille 1979 (Berlin, 1979), E. W. Ng, Ed., vol. 72 of Lecture Notes in Computer Science, Springer-Verlag, pp. 452-465.

12   HOLT, D. F. Representing quotients of permutation groups. To appear in Quar. J. Math. (Oxford} (1997).

13   William M. Kantor, Finding composition factors of permutation groups of degree n≤ 106

14   LACE, R., NEUB/JsEn, J., AND SCHOENWAELDER, U. Algorithms for finite soluble groups and the SOGOS system. In Computational Group Theory (New York, 1984), M. D. Atkinson, Ed., Academic Press, pp. 105- 135.

15   Jeffrey S. Leon, Permutation group algorithms based on partitions, I: theory and algorithms

16   MECKY, M., AND NEUBiJSER, J. Some remarks on the computation of conjugacy classes of soluble groups. Bull. Austral. Math. Soc. 40 (1989), 281-292.

17   SCHONERT, M., ET AL. GAP -- Groups, Algorithms and Programming. Lehrstuhl D fAir Mathematik, RWTH, Aachen, 1994.

18   SCOTT, L. L. Representations in characteristic p. In The Santa-Cruz conference on finite groups (Providence, Rhode Island, 1980), B. Cooperstein and G. Mason, Eds., vol. 37 of Proceedings of Symposia in Pure Mathematics, AMS, pp. 319-331.

19   SIMS, C. C. Determining the conjugacy classes of a permutation group. In Computers in algebra and number theory, Proceedings of a symposium in applied mathematics, New York, 1970 (Providence, Rhode Island, 1971), G. Birkhoff and M. Hall Jr., Eds., vol. 4, AMS, pp. 191-195.

• Editorial pointers
  Communications of the ACM   44, 9
  Diane Crawford
  
  
• News track
  Communications of the ACM   44, 9
  Robert Fox
  
  
• Forum
  Communications of the ACM   44, 9
  Diane Crawford
  
  
• New Products
  Linux Journal   1996, 27es
  CORPORATE Linux Journal Staff
  
  
• Editorial
  interactions   8, 5
  Steven Pemberton